LEADER 05688nam 22008055 450 001 996465827303316 005 20230222091011.0 010 $a1-280-38966-4 010 $a9786613567581 010 $a3-642-16242-8 024 7 $a10.1007/978-3-642-16242-8 035 $a(CKB)2550000000019873 035 $a(SSID)ssj0000446604 035 $a(PQKBManifestationID)11318366 035 $a(PQKBTitleCode)TC0000446604 035 $a(PQKBWorkID)10496869 035 $a(PQKB)11785815 035 $a(DE-He213)978-3-642-16242-8 035 $a(MiAaPQ)EBC3065964 035 $z(PPN)147565022 035 $a(PPN)149029748 035 $a(EXLCZ)992550000000019873 100 $a20101004d2010 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aLogic for Programming, Artificial Intelligence, and Reasoning$b[electronic resource] $e17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010, Proceedings /$fedited by Christian G. Fermüller, Andrei Voronkov 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XII, 656 p. 83 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6397 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-16241-X 320 $aIncludes bibliographical references and index. 327 $aThe 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6397 606 $aArtificial intelligence 606 $aSoftware engineering 606 $aComputer science 606 $aMachine theory 606 $aComputer programming 606 $aCompilers (Computer programs) 606 $aArtificial Intelligence 606 $aSoftware Engineering 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aProgramming Techniques 606 $aCompilers and Interpreters 615 0$aArtificial intelligence. 615 0$aSoftware engineering. 615 0$aComputer science. 615 0$aMachine theory. 615 0$aComputer programming. 615 0$aCompilers (Computer programs). 615 14$aArtificial Intelligence. 615 24$aSoftware Engineering. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aProgramming Techniques. 615 24$aCompilers and Interpreters. 676 $a006.3 702 $aFermüller$b Christian G$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVoronkov$b Andrei$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aLPAR (Conference) 906 $aBOOK 912 $a996465827303316 996 $aLogic for Programming, Artificial Intelligence, and Reasoning$9772423 997 $aUNISA