Logic for Programming, Artificial Intelligence, and Reasoning [electronic resource] : 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003. Proceedings / edited by Moshe Y. Vardi, Andrei Voronkov.
Material type: TextSeries: Lecture Notes in Computer Science ; 2850Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2003Description: XI, 436 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540398134Subject(s): Computer science | Software engineering | Logic design | Artificial intelligence | Computer Science | Artificial Intelligence (incl. Robotics) | Programming Techniques | Software Engineering | Logics and Meanings of Programs | Mathematical Logic and Formal LanguagesAdditional physical formats: Printed edition:: No titleDDC classification: 006.3 LOC classification: Q334-342TJ210.2-211.495Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK4723 |
From Tableaux to Automata for Description Logics -- Disproving False Conjectures -- A Formal Proof of Dickson’s Lemma in ACL2 -- Imperative Object-Based Calculi in Co-inductive Type Theories -- Congruence Closure with Integer Offsets -- A Machine-Verified Code Generator -- A Translation Characterizing the Constructive Content of Classical Theories -- Extensions of Non-standard Inferences to Description Logics with Transitive Roles -- Extended Canonicity of Certain Topological Properties of Set Spaces -- Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics -- Improving Dependency Pairs -- On Closure under Complementation of Equational Tree Automata for Theories Extending AC -- Completeness of E-Unification with Eager Variable Elimination -- Computable Numberings -- Handling Equality in Monodic Temporal Resolution -- Once upon a Time in the West -- Ordered Diagnosis -- Computing Preferred Answer Sets in Answer Set Programming -- A Syntax-Based Approach to Reasoning about Actions and Events -- Minimizing Automata on Infinite Words -- Gandy’s Theorem for Abstract Structures without the Equality Test -- Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems -- NP-Completeness Results for Deductive Problems on Stratified Terms -- Is Cantor’s Theorem Automatic? -- Automatic Structures of Bounded Degree -- An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems -- A Logical Study on Qualitative Default Reasoning with Probabilities -- On Structuring Proof Search for First Order Linear Logic -- Strict Geometry of Interaction Graph Models -- Connection-Based Proof Construction in Non-commutative Logic.
There are no comments on this title.