Vor Ort
Merkzettel Warenkorb
  • Produktbild: Logic for Programming, Artificial Intelligence, and Reasoning
  • Produktbild: Logic for Programming, Artificial Intelligence, and Reasoning
Band 6397

Logic for Programming, Artificial Intelligence, and Reasoning 17th International Conference, LPAR-17, Yogyakarta, Indonesia, October 10-15, 2010, Proceedings

Aus der Reihe Lecture Notes in Computer Science

97,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

27.09.2010

Herausgeber

Christian G. Fermüller + weitere

Verlag

Springer Berlin

Seitenzahl

656

Maße (L/B/H)

23,8/15,9/2,8 cm

Gewicht

938 g

Auflage

2010

Sprache

Englisch

ISBN

978-3-642-16241-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

27.09.2010

Herausgeber

Verlag

Springer Berlin

Seitenzahl

656

Maße (L/B/H)

23,8/15,9/2,8 cm

Gewicht

938 g

Auflage

2010

Sprache

Englisch

ISBN

978-3-642-16241-1

Herstelleradresse

Springer-Verlag GmbH
Heidelberger Platz 3
14197 Berlin
Deutschland
Email: sdc-bookservice@springer.com
Url: www.springer.com
Telephone: +49 6221 3454301
Fax: +49 30 8214091

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Logic for Programming, Artificial Intelligence, and Reasoning
  • Produktbild: Logic for Programming, Artificial Intelligence, and Reasoning
  • 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 with Eventualities 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.