000 05030nam a22006015i 4500
001 978-3-540-48282-6
003 DE-He213
005 20240730191018.0
007 cr nn 008mamaa
008 100301s2006 gw | s |||| 0|eng d
020 _a9783540482826
_9978-3-540-48282-6
024 7 _a10.1007/11916277
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
245 1 0 _aLogic for Programming, Artificial Intelligence, and Reasoning
_h[electronic resource] :
_b13th International Conference, LPAR 2006, Phnom Penh, Cambodia, November 13-17, 2006, Proceedings /
_cedited by Miki Hermann, Andrei Voronkov.
250 _a1st ed. 2006.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2006.
300 _aXIV, 592 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v4246
505 0 _aHigher-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.
650 0 _aArtificial intelligence.
_93407
650 0 _aComputer programming.
_94169
650 0 _aSoftware engineering.
_94138
650 0 _aComputer science.
_99832
650 0 _aMachine theory.
_9144847
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aProgramming Techniques.
_9144848
650 2 4 _aSoftware Engineering.
_94138
650 2 4 _aComputer Science Logic and Foundations of Programming.
_942203
650 2 4 _aFormal Languages and Automata Theory.
_9144849
700 1 _aHermann, Miki.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9144850
700 1 _aVoronkov, Andrei.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9144851
710 2 _aSpringerLink (Online service)
_9144852
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540482819
776 0 8 _iPrinted edition:
_z9783540832270
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v4246
_9144853
856 4 0 _uhttps://doi.org/10.1007/11916277
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c93573
_d93573