×

zbMATH — the first resource for mathematics

Logic for programming, artificial intelligence, and reasoning. 17th international conference, LPAR-17, Yogyakarta, Indonesia, October 10–15, 2010. Proceedings. (English) Zbl 1197.68008
Lecture Notes in Computer Science 6397. Berlin: Springer (ISBN 978-3-642-16241-1/pbk). xii, 656 p. (2010).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 1203.68004).
Indexed articles:
Chatterjee, Krishnendu; Doyen, Laurent, The complexity of partial-observation parity games, 1-14 [Zbl 1298.91050]
Maher, Michael J., Human and unhuman commonsense reasoning, 16-29 [Zbl 1298.03080]
Preining, Norbert, Gödel logics – a survey, 30-51 [Zbl 1298.03075]
Alenda, Régis; Olivetti, Nicola, Tableau calculus for the logic of comparative similarity over arbitrary distance spaces, 52-66 [Zbl 1306.68178]
Axelsson, Roland; Hague, Matthew; Kreutzer, Stephan; Lange, Martin; Latte, Markus, Extended computation tree logic, 67-81 [Zbl 1306.68098]
Baader, Franz; Lippmann, Marcel; Liu, Hongkai, Using causal relationships to deal with the ramification problem in action formalisms based on description logics, 82-96 [Zbl 1306.68180]
Baader, Franz; Morawska, Barbara, SAT encoding of unification in \(\mathcal{EL}\), 97-111 [Zbl 1306.68181]
Banbara, Mutsunori; Matsunaka, Haruki; Tamura, Naoyuki; Inoue, Katsumi, Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers, 112-126 [Zbl 1306.68182]
Blanchette, Jasmin Christian; Claessen, Koen, Generating counterexamples for structural inductions by exploiting nonstandard models, 127-141 [Zbl 1306.68139]
Bonfante, Guillaume; Moser, Georg, Characterising space complexity classes via Knuth-Bendix orders, 142-156 [Zbl 1306.68040]
Brock-Nannestad, Taus; Schürmann, Carsten, Focused natural deduction, 157-171 [Zbl 1307.03034]
Brünnler, Kai, How to universally close the existential rule, 172-186 [Zbl 1307.03009]
Charatonik, Witold; Witkowski, Piotr, On the complexity of the Bernays-Schönfinkel class with Datalog, 187-201 [Zbl 1307.03019]
Chaudhuri, Kaustuv, Magically constraining the inverse method using dynamic polarity assignment, 202-216 [Zbl 1306.68005]
Codish, Michael; Fuhs, Carsten; Giesl, Jürgen; Schneider-Kamp, Peter, Lazy abstraction for size-change termination, 217-232 [Zbl 1306.68022]
Condotta, Jean-François; Kaci, Souhila; Marquis, Pierre; Schwind, Nicolas, A syntactical approach to qualitative constraint networks merging, 233-247 [Zbl 1306.68207]
David, Claire; Libkin, Leonid; Tan, Tony, On the satisfiability of two-variable logic over data words, 248-262 [Zbl 1307.03020]
Dawson, Jeremy E.; Goré, Rajeev, Generic methods for formalising sequent calculi applied to provability logic, 263-277 [Zbl 1307.03033]
Deng, Yuxin; van Glabbeek, Rob, Characterising probabilistic processes logically (extended abstract), 278-293 [Zbl 1306.68122]
Ferrari, Mauro; Fiorentini, Camillo; Fiorino, Guido, fCube: an efficient prover for intuitionistic propositional logic, 294-301 [Zbl 1306.68141]
Fietzke, Arnaud; Hermanns, Holger; Weidenbach, Christoph, Superposition-based analysis of first-order probabilistic timed automata, 302-316 [Zbl 1306.68095]
Giordano, Laura; Gliozzi, Valentina; Olivetti, Nicola; Pozzato, Gian Luca, A nonmonotonic extension of KLM preferential logic P, 317-332 [Zbl 1307.03018]
Grégoire, Benjamin; Sacchini, Jorge Luis, On strong normalization of the calculus of constructions with type-based termination, 333-347 [Zbl 1306.68142]
Henzinger, Thomas A.; Hottelier, Thibaud; Kovács, Laura; Rybalchenko, Andrey, Aligators for arrays (tool paper), 348-356 [Zbl 1306.68143]
Heule, Marijn; Järvisalo, Matti; Biere, Armin, Clause elimination procedures for CNF formulas, 357-371 [Zbl 1306.68144]
Hyvärinen, Antti E. J.; Junttila, Tommi; Niemelä, Ilkka, Partitioning SAT instances for distributed solving, 372-386 [Zbl 1306.68146]
Jouannaud, Jean-Pierre; Monate, Benjamin, Infinite families of finite string rewriting systems and their confluence, 387-401 [Zbl 1306.68075]
Jovanović, Dejan; Barrett, Clark, Polite theories revisited, 402-416 [Zbl 1306.68147]
Kaminski, Mark; Smolka, Gert, Clausal graph tableaux for hybrid logic with eventualities and difference, 417-431 [Zbl 1307.03013]
Klinov, Pavel; Parsia, Bijan; Picado-Muiño, David, The consistency of the CADIAG-2 knowledge base: a probabilistic approach, 432-446 [Zbl 1306.68205]
Kolokolova, Antonina; Liu, Yongmei; Mitchell, David; Ternovska, Eugenia, On the complexity of model expansion, 447-458 [Zbl 1307.03021]
Korovin, Konstantin; Sticksel, Christoph, Labelled unit superposition calculi for instantiation-based reasoning, 459-473 [Zbl 1306.68192]
Audemard, Gilles; Lagniez, Jean-Marie; Mazure, Bertrand; Saïs, Lakhdar, Boosting local search thanks to cdcl, 474-488 [Zbl 1306.68138]
Kroening, Daniel; Leroux, Jérôme; Rümmer, Philipp, Interpolating quantifier-free Presburger arithmetic, 489-503 [Zbl 1306.68148]
Mantadelis, Theofrastos; Janssens, Gerda, Variable compression in ProbLog, 504-518 [Zbl 1306.68010]
Hölldobler, Steffen; Manthey, Norbert; Saptawijaya, Ari, Improving resource-unaware SAT solvers, 519-534 [Zbl 1306.68145]
McKinley, Richard, Expansion nets: proof-nets for propositional classical logic, 535-549 [Zbl 1307.03032]
Neurauter, Friedrich; Zankl, Harald; Middeldorp, Aart, Revisiting matrix interpretations for polynomial derivational complexity of term rewriting, 550-564 [Zbl 1306.68083]
Papapanagiotou, Petros; Fleuriot, Jacques, An Isabelle-like procedural mode for HOL Light, 565-580 [Zbl 1306.68149]
Reuß, Andreas; Seidl, Helmut, Bottom-up tree automata with term constraints, 581-593 [Zbl 1306.68096]
Rocha, Camilo; Meseguer, José, Constructors, sufficient completeness, and deadlock freedom of rewrite theories, 594-609 [Zbl 1306.68087]
Tasharrofi, Shahab; Ternovska, Eugenia, PBINT, a logic for modelling search problems involving arithmetic, 610-624 [Zbl 1307.03022]
Teige, Tino; Fränzle, Martin, Resolution for stochastic Boolean satisfiability, 625-639 [Zbl 1306.68175]
Veanes, Margus; Bjørner, Nikolaj; de Moura, Leonardo, Symbolic automata constraint solving, 640-654 [Zbl 1306.68097]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
03-06 Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations
03B70 Logic in computer science
68T27 Logic in artificial intelligence
00B25 Proceedings of conferences of miscellaneous specific interest
Software:
HOL Light
PDF BibTeX XML Cite
Full Text: DOI