05688nam 22008055 450 99646582730331620230222091011.01-280-38966-497866135675813-642-16242-810.1007/978-3-642-16242-8(CKB)2550000000019873(SSID)ssj0000446604(PQKBManifestationID)11318366(PQKBTitleCode)TC0000446604(PQKBWorkID)10496869(PQKB)11785815(DE-He213)978-3-642-16242-8(MiAaPQ)EBC3065964(PPN)147565022(PPN)149029748(EXLCZ)99255000000001987320101004d2010 u| 0engurnn#008mamaatxtccrLogic for Programming, Artificial Intelligence, and Reasoning[electronic resource] 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010, Proceedings /edited by Christian G. Fermüller, Andrei Voronkov1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XII, 656 p. 83 illus.)Theoretical Computer Science and General Issues,2512-2029 ;6397Bibliographic Level Mode of Issuance: Monograph3-642-16241-X Includes bibliographical references and index.The Complexity of Partial-Observation Parity Games -- Awareness in Games, Awareness in Logic -- Human and Unhuman Commonsense Reasoning -- Gödel Logics – A Survey -- Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces -- Extended Computation Tree Logic -- Using Causal Relationships to Deal with the Ramification Problem in Action Formalisms Based on Description Logics -- SAT Encoding of Unification in -- Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers -- Generating Counterexamples for Structural Inductions by Exploiting Nonstandard Models -- Characterising Space Complexity Classes via Knuth-Bendix Orders -- Focused Natural Deduction -- How to Universally Close the Existential Rule -- On the Complexity of the Bernays-Schönfinkel Class with Datalog -- Magically Constraining the Inverse Method Using Dynamic Polarity Assignment -- Lazy Abstraction for Size-Change Termination -- A Syntactical Approach to Qualitative Constraint Networks Merging -- On the Satisfiability of Two-Variable Logic over Data Words -- Generic Methods for Formalising Sequent Calculi Applied to Provability Logic -- Characterising Probabilistic Processes Logically -- fCube: An Efficient Prover for Intuitionistic Propositional Logic -- Superposition-Based Analysis of First-Order Probabilistic Timed Automata -- A Nonmonotonic Extension of KLM Preferential Logic P -- On Strong Normalization of the Calculus of Constructions with Type-Based Termination -- Aligators for Arrays (Tool Paper) -- Clause Elimination Procedures for CNF Formulas -- Partitioning SAT Instances for Distributed Solving -- Infinite Families of Finite String Rewriting Systems and Their Confluence -- Polite Theories Revisited -- Clausal Graph Tableaux for Hybrid Logic with Eventualities and Difference -- The Consistency of the CADIAG-2 Knowledge Base: A Probabilistic Approach -- On the Complexity of Model Expansion -- Labelled Unit Superposition Calculi for Instantiation-Based Reasoning -- Boosting Local Search Thanks to cdcl -- Interpolating Quantifier-Free Presburger Arithmetic -- Variable Compression in ProbLog -- Improving Resource-Unaware SAT Solvers -- Expansion Nets: Proof-Nets for Propositional Classical Logic -- Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting -- An Isabelle-Like Procedural Mode for HOL Light -- Bottom-Up Tree Automata with Term Constraints -- Constructors, Sufficient Completeness, and Deadlock Freedom of Rewrite Theories -- PBINT, A Logic for Modelling Search Problems Involving Arithmetic -- Resolution for Stochastic Boolean Satisfiability -- Symbolic Automata Constraint Solving.Theoretical Computer Science and General Issues,2512-2029 ;6397Artificial intelligenceSoftware engineeringComputer scienceMachine theoryComputer programmingCompilers (Computer programs)Artificial IntelligenceSoftware EngineeringComputer Science Logic and Foundations of ProgrammingFormal Languages and Automata TheoryProgramming TechniquesCompilers and InterpretersArtificial intelligence.Software engineering.Computer science.Machine theory.Computer programming.Compilers (Computer programs).Artificial Intelligence.Software Engineering.Computer Science Logic and Foundations of Programming.Formal Languages and Automata Theory.Programming Techniques.Compilers and Interpreters.006.3Fermüller Christian Gedthttp://id.loc.gov/vocabulary/relators/edtVoronkov Andreiedthttp://id.loc.gov/vocabulary/relators/edtLPAR (Conference)BOOK996465827303316Logic for Programming, Artificial Intelligence, and Reasoning772423UNISA