Logic for Programming, Artificial Intelligence, and Reasoning - edizione con copertina flessibile

EAN (ISBN-13): 9783642162411
ISBN (ISBN-10): 364216241X
Copertina rigida
Copertina flessibile
Anno di pubblicazione: 2010
Editore: Springer Berlin
656 Pagine
Peso: 0,938 kg
Lingua: eng/Englisch

Libro nella banca dati dal 2007-05-22T00:08:53+02:00 (Zurich)
Pagina di dettaglio ultima modifica in 2023-04-29T08:50:31+02:00 (Zurich)
ISBN/EAN: 364216241X

ISBN - Stili di scrittura alternativi:
3-642-16241-X, 978-3-642-16241-1
Stili di scrittura alternativi e concetti di ricerca simili:
Autore del libro : voronkov, christian schulz, schulz stephan, halpern, arti, matthias schulz, michael stephan, schulz joseph
Titolo del libro: oni, art programming, reasoning science, reason art, proceedings artificial intelligence conference, yogyakarta, logic computer science, october, artificial general intelligence, logic pro

---

Dati dell'editore

Autore: Christian G. Fermüller; Andrei Voronkov
Titolo: Theoretical Computer Science and General Issues; Lecture Notes in Computer Science; Logic for Programming, Artificial Intelligence, and Reasoning - 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010, Proceedings
Editore: Springer; Springer Berlin
656 Pagine
Anno di pubblicazione: 2010-09-27
Berlin; Heidelberg; DE
Lingua: Inglese
106,99 € (DE)
109,99 € (AT)
118,00 CHF (CH)
Available
XII, 656 p. 83 illus.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Künstliche Intelligenz; Verstehen; Informatik; Extension; artificial intelligence; automated reasoning; computational complexity; concurrency; constraint programming; description logic; description logics; distributed systems; knowledge; knowledge base; knowledge representation; model checking; modeling; proving; Artificial Intelligence; Software Engineering; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Programming Techniques; Compilers and Interpreters; Software Engineering; Theoretische Informatik; Computerprogrammierung und Softwareentwicklung; Compiler und Übersetzer; EA

The 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.