Logic for Programming, Artificial Intelligence, and Reasoning  13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings /  [electronic resource] : 
edited by Miki Hermann, Andrei Voronkov. 
 - 1st ed. 2006. 
 - XIV, 592 p.  online resource. 
 - Lecture Notes in Artificial Intelligence,  4246  2945-9141 ; .
 - Lecture Notes in Artificial Intelligence,  4246 .
<br/><br/>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. 
<br/><br/><label>ISBN: </label>9783540482826 
<br/><br/><label>Standard No.: </label>10.1007/11916277  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Artificial intelligence.<br/>Computer programming.<br/>Software engineering.<br/>Computer science.<br/>Machine theory.<br/>Artificial Intelligence.<br/>Programming Techniques.<br/>Software Engineering.<br/>Computer Science Logic and Foundations of Programming.<br/>Formal Languages and Automata Theory.
<br/><br/><label>LC Class. No.: </label>Q334-342 TA347.A78 
<br/><br/><label>Dewey Class. No.: </label>006.3