Franklin

Logic for Programming, Artificial Intelligence, and Reasoning [electronic resource] : 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings / edited by Moshe Vardi, Andrei Voronkov.

Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
Format/Description:
Book
1 online resource (XI, 436 pages)
Edition:
1st ed. 2003.
Series:
Computer Science (Springer-11645)
Lecture notes in computer science. Lecture notes in artificial intelligence 2850
Lecture Notes in Artificial Intelligence ; 2850
Contained In:
Springer eBooks
Status/Location:
Loading...

Options
Location Notes Your Loan Policy

Details

Subjects:
Software engineering.
Artificial intelligence.
Computer programming.
Computer logic.
Logic, Symbolic and mathematical.
Local subjects:
Software Engineering/Programming and Operating Systems. (search)
Artificial Intelligence. (search)
Programming Techniques. (search)
Software Engineering. (search)
Logics and Meanings of Programs. (search)
Mathematical Logic and Formal Languages. (search)
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.
Contributor:
Vardi, Moshe. editor., Editor,
Voronkov, Andrei. editor., Editor,
SpringerLink (Online service)
Other format:
Printed edition:
Printed edition:
ISBN:
978-3-540-39813-4
9783540398134
Publisher Number:
10.1007/b13986 doi
Access Restriction:
Restricted for use by site license.