1 option
Logic for Programming, Artificial Intelligence, and Reasoning : 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings / edited by Moshe Vardi, Andrei Voronkov.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science. Lecture notes in artificial intelligence ; 2850.
- Lecture Notes in Artificial Intelligence ; 2850
- Language:
- English
- Subjects (All):
- Software engineering.
- Artificial intelligence.
- Computer programming.
- Computer logic.
- Logic, Symbolic and mathematical.
- Software Engineering/Programming and Operating Systems.
- Artificial Intelligence.
- Programming Techniques.
- Software Engineering.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Local Subjects:
- Software Engineering/Programming and Operating Systems.
- Artificial Intelligence.
- Programming Techniques.
- Software Engineering.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Physical Description:
- 1 online resource (XI, 436 pages).
- Edition:
- First edition 2003.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-39813-4
- 9783540398134
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.