Logic for Programming, Artificial Intelligence, and Reasoning: 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010. Proceedings

Description

This book constitutes the refereed proceedings of the 17th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR-17, held in Yogyakarta, Indonesia, in October 2010. The 41 revised full papers presented were carefully reviewed and selected from 133 submissions. Front Matter....Pages - The Complexity of Partial-Observation Parity Games....Pages 1-14 Awareness in Games, Awareness in Logic....Pages 15-15 Human and Unhuman Commonsense Reasoning....Pages 16-29 Gödel Logics – A Survey....Pages 30-51 Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces....Pages 52-66 Extended Computation Tree Logic....Pages 67-81 Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics....Pages 82-96 SAT Encoding of Unification in $\mathcal{EL}$ ....Pages 97-111 Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers....Pages 112-126 Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models....Pages 127-141 Characterising Space Complexity Classes via Knuth-Bendix Orders....Pages 142-156 Focused Natural Deduction....Pages 157-171 How to Universally Close the Existential Rule....Pages 172-186 On the Complexity of the Bernays-Schönfinkel Class with Datalog....Pages 187-201 Magically Constraining the Inverse Method Using Dynamic Polarity Assignment....Pages 202-216 Lazy Abstraction for Size-Change Termination....Pages 217-232 A Syntactical Approach to Qualitative Constraint Networks Merging....Pages 233-247 On the Satisfiability of Two-Variable Logic over Data Words....Pages 248-262 Generic Methods for Formalising Sequent Calculi Applied to Provability Logic....Pages 263-277 Characterising Probabilistic Processes Logically....Pages 278-293 fCube : An Efficient Prover for Intuitionistic Propositional Logic....Pages 294-301 Superposition-Based Analysis of First-Order Probabilistic Timed Automata....Pages 302-316 A Nonmonotonic Extension of KLM Preferential Logic P ....Pages 317-332 On Strong Normalization of the Calculus of Constructions with Type-Based Termination....Pages 333-347 Aligators for Arrays (Tool Paper)....Pages 348-356 Clause Elimination Procedures for CNF Formulas....Pages 357-371 Partitioning SAT Instances for Distributed Solving....Pages 372-386 Infinite Families of Finite String Rewriting Systems and Their Confluence....Pages 387-401 Polite Theories Revisited....Pages 402-416 Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference....Pages 417-431 The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach....Pages 432-446 On the Complexity of Model Expansion....Pages 447-458 Labelled Unit Superposition Calculi for Instantiation-Based Reasoning....Pages 459-473 Boosting Local Search Thanks to cdcl ....Pages 474-488 Interpolating Quantifier-Free Presburger Arithmetic....Pages 489-503 Variable Compression in ProbLog....Pages 504-518 Improving Resource-Unaware SAT Solvers....Pages 519-534 Expansion Nets: Proof-Nets for Propositional Classical Logic....Pages 535-549 Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting....Pages 550-564 An Isabelle-Like Procedural Mode for HOL Light....Pages 565-580 Bottom-Up Tree Automata with Term Constraints....Pages 581-593 Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories....Pages 594-609 PBINT, A Logic for Modelling Search Problems Involving Arithmetic....Pages 610-624 Resolution for Stochastic Boolean Satisfiability....Pages 625-639 Symbolic Automata Constraint Solving....Pages 640-654 Back Matter....Pages -