Logic for Programming, Artificial Intelligence, and Reasoning : 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings - nouveau livre

EAN (ISBN-13): 9783540482826
Date de parution: 2006
Editeur: Springer Berlin Heidelberg

Livre dans la base de données depuis 2017-04-19T00:48:13+02:00 (Paris)
Page de détail modifiée en dernier sur 2023-07-31T09:07:58+02:00 (Paris)
ISBN/EAN: 9783540482826

ISBN - Autres types d'écriture:
978-3-540-48282-6
Autres types d'écriture et termes associés:
Auteur du livre: voronkov, max springer
Titre du livre: cambodia, logic programming, artificial intelligence programming

---

Données de l'éditeur

Auteur: Miki Hermann; Andrei Voronkov
Titre: Lecture Notes in Computer Science; Lecture Notes in Artificial Intelligence; Logic for Programming, Artificial Intelligence, and Reasoning - 13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings
Editeur: Springer; Springer Berlin
592 Pages
Date de parution: 2006-10-18
Berlin; Heidelberg; DE
Langue: Anglais
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XIV, 592 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Künstliche Intelligenz; Verstehen; Artificial intelligence; Automat; automated reasoning; formal method; intelligence; logic; programming; C; Artificial Intelligence; Programming Techniques; Software Engineering; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Computer Science; Computerprogrammierung und Softwareentwicklung; Software Engineering; Theoretische Informatik; BC

Higher-Order Termination: From Kruskal to Computability.- Deciding Satisfiability of Positive Second Order Joinability Formulae.- SAT Solving for Argument Filterings.- Inductive Decidability Using Implicit Induction.- Matching Modulo Superdevelopments Application to Second-Order Matching.- Derivational Complexity of Knuth-Bendix Orders Revisited.- A Characterization of Alternating Log Time by First Order Functional Programs.- Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems.- On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus.- Modular Cut-Elimination: Finding Proofs or Counterexamples.- An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf.- A Semantic Completeness Proof for TaMeD.- Saturation Up to Redundancy for Tableau and Sequent Calculi.- Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints.- Combining Supervaluation and Degree Based Reasoning Under Vagueness.- A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes.- A Local System for Intuitionistic Logic.- CIC : Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions.- Reducing Nondeterminism in the Calculus of Structures.- A Relaxed Approach to Integrity and Inconsistency in Databases.- On Locally Checkable Properties.- Deciding Key Cycles for Security Protocols.- Automating Verification of Loops by Parallelization.- On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems.- Verification Condition Generation Via Theorem Proving.- An Incremental Approach to Abstraction-Carrying Code.- Context-Sensitive Multivariant Assertion Checking in ModularPrograms.- Representation of Partial Knowledge and Query Answering in Locally Complete Databases.- Sequential, Parallel, and Quantified Updates of First-Order Structures.- Representing Defaults and Negative Information Without Negation-as-Failure.- Constructing Camin-Sokal Phylogenies Via Answer Set Programming.- Automata for Positive Core XPath Queries on Compressed Documents.- Boolean Rings for Intersection-Based Satisfiability.- Theory Instantiation.- Splitting on Demand in SAT Modulo Theories.- Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis.- Automatic Combinability of Rewriting-Based Satisfiability Procedures.- To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in .- Lemma Learning in the Model Evolution Calculus.