Logic for Programming, Artificial Intelligence, and Reasoning
| Themengebiete: | Intelligenz / Künstliche Intelligenz KI Künstliche Intelligenz - AI Logik Logikprogrammierung Philosophie / Logik |
|---|---|
| Veröffentlichungsdatum: | 12.09.2003 |
| EAN: | 9783540201014 |
| Sprache: | Englisch |
| Seitenzahl: | 456 |
| Produktart: | Kartoniert / Broschiert |
| Herausgeber: | Vardi, Moshe Voronkov, Andrei |
| Verlag: | Springer Springer-Verlag GmbH |
| Untertitel: | 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, Proceedings |
Produktinformationen "Logic for Programming, Artificial Intelligence, and Reasoning"
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.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen