000			05134nam a22006255i 4500
001			978-3-642-16242-8
003			DE-He213
005			20240423125851.0
007			cr nn 008mamaa
008			101004s2010 gw | s |||| 0|eng d
020			_a9783642162428 _9978-3-642-16242-8
024	7		_a10.1007/978-3-642-16242-8 _2doi
050		4	_aQ334-342
050		4	_aTA347.A78
072		7	_aUYQ _2bicssc
072		7	_aCOM004000 _2bisacsh
072		7	_aUYQ _2thema
082	0	4	_a006.3 _223
245	1	0	_aLogic for Programming, Artificial Intelligence, and Reasoning _h[electronic resource] : _b17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010, Proceedings / _cedited by Christian G. Fermüller, Andrei Voronkov.
250			_a1st ed. 2010.
264		1	_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2010.
300			_aXII, 656 p. 83 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6397
505	0		_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 withEventualities 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.
650		0	_aArtificial intelligence.
650		0	_aSoftware engineering.
650		0	_aComputer science.
650		0	_aMachine theory.
650		0	_aComputer programming.
650		0	_aCompilers (Computer programs).
650	1	4	_aArtificial Intelligence.
650	2	4	_aSoftware Engineering.
650	2	4	_aComputer Science Logic and Foundations of Programming.
650	2	4	_aFormal Languages and Automata Theory.
650	2	4	_aProgramming Techniques.
650	2	4	_aCompilers and Interpreters.
700	1		_aFermüller, Christian G. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
700	1		_aVoronkov, Andrei. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt
710	2		_aSpringerLink (Online service)
773	0		_tSpringer Nature eBook
776	0	8	_iPrinted edition: _z9783642162411
776	0	8	_iPrinted edition: _z9783642162435
830		0	_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6397
856	4	0	_uhttps://doi.org/10.1007/978-3-642-16242-8
912			_aZDB-2-SCS
912			_aZDB-2-SXCS
912			_aZDB-2-LNC
942			_cSPRINGER
999			_c182531 _d182531