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

by Fermuller, Christian G.; Voronkov, Andrei

• ISBN13: 9783642162411
• ISBN10: 364216241X
• Format: Paperback
• Copyright: 2010-11-07
• Publisher: Springer-Verlag New York Inc

Summary

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.

Table of Contents

The Complexity of Partial-Observation Parity Games (Invited Talk)	p. 1
Awareness in Games, Awareness in Logic (Invited Talk)	p. 15
Human and Unhuman Commonsense Reasoning (Invited Talk)	p. 16
Gödel Logics - A Survey (Invited Tutorial)	p. 30
Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces	p. 52
Extended Computation Tree Logic	p. 67
Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics	p. 82
SAT Encoding of Unification in ¿L	p. 97
Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers	p. 112
Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models	p. 127
Characterising Space Complexity Classes via Knuth-Bendix Orders	p. 142
Focused Natural Deduction	p. 157
How to Universally Close the Existential Rule	p. 172
On the Complexity of the Bernays-Schönfinkel Class with Datalog	p. 187
Magically Constraining the Inverse Method Using Dynamic Polarity Assignment	p. 202
Lazy Abstraction for Size-Change Termination	p. 217
A Syntactical Approach to Qualitative Constraint Networks Merging	p. 233
On the Satisfiability of Two-Variable Logic over Data Words	p. 248
Generic Methods for Formalising Sequent Calculi Applied to Provability Logic	p. 263
Characterising Probabilistic Processes Logically (Extended Abstract)	p. 278
fCube: An Efficient Prover for Intuitionistic Propositional Logic	p. 294
Superposition-Based Analysis of First-Order Probabilistic Timed Automata	p. 302
A Nonmonotonic Extension of KLM Preferential Logic P	p. 317
On Strong Normalization of the Calculus of Constructions with Type-Based Termination	p. 333
Aligators for Arrays (Tool Paper)	p. 348
Clause Elimination Procedures for CNF Formulas	p. 357
Partitioning SAT Instances for Distributed Solving	p. 372
Infinite Families of Finite String Rewriting Systems and Their Confluence	p. 387
Polite Theories Revisited	p. 402
Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference	p. 417
The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach	p. 432
On the Complexity of Model Expansion	p. 447
Labelled Unit Superposition Calculi for Instantiation-Based Reasoning	p. 459
Boosting Loral Search Thanks to CDCL	p. 474
Interpolating Quantifier-Free Presburger Arithmetic	p. 489
Variable Compression in ProbLog	p. 504
Improving Resource-Unaware SAT Solvers	p. 519
Expansion Nets: Proof-Nets for Propositional Classical Logic	p. 535
Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting	p. 550
An Isabelle-Like Procedural Mode for HOL Light	p. 565
Bottom-Up Tree Automata with Term Constraints	p. 581
Constructors, Sufficient Completeness, Deadlock Freedom of Rewrite Theories	p. 594
PBINT, A Logic for Modelling Search Problems Involving Arithmetic	p. 610
Resolution for Stochastic Boolean Satisfiability	p. 625
Symbolic Automata Constraint Solving	p. 640
Author Index	p. 655
Table of Contents provided by Ingram. All Rights Reserved.