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

Paperback (Print)
Buy New
Buy New from BN.com
Used and New from Other Sellers
Used and New from Other Sellers
from $65.85
Usually ships in 1-2 business days
(Save 58%)
Other sellers (Paperback)
  • All (9) from $65.85   
  • New (7) from $107.05   
  • Used (2) from $65.85   


This book constitutes the refereed proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2006, held in Phnom Penh, Cambodia in November 2006. The 38 revised full papers presented together with one invited talk were carefully reviewed and selected from 96 submissions.

Read More Show Less

Product Details

Table of Contents

Higher-Order Termination: From Kruskal to Computability   Frederic Blanqui   Jean-Pierre Jouannaud   Albert Rubio     1
Deciding Satisfiability of Positive Second Order Joinability Formulae   Sebastien Limet   Pierre Pillot     15
SAT Solving for Argument Filterings   Michael Codish   Peter Schneider-Kamp   Vitaly Lagoon   Rene Thiemann   Jurgen Giesl     30
Inductive Decidability Using Implicit Induction   Stephan Falke   Deepak Kapur     45
Matching Modulo Superdevelopments Application to Second-Order Matching   Germain Faure     60
Derivational Complexity of Knuth-Bendix Orders Revisited   Georg Moser     75
A Characterization of Alternating Log Time by First Order Functional Programs   Guillaume Bonfante   Jean-Yves Marion   Romain Pechoux     90
Combining Typing and Size Constraints for Checking the Termination of Higher-Order Conditional Rewrite Systems   Frederic Blanqui   Colin Riba     105
On a Local-Step Cut-Elimination Procedure for the Intuitionistic Sequent Calculus   Kentaro Kikuchi     120
Modular Cut-Elimination: Finding Proofs or Counterexamples   Agata Ciabattoni   Kazushige Terui     135
An Executable Formalization of the HOL/Nuprl Connection in the Metalogical Framework Twelf   Carsten Schurmann   Mark-Oliver Stehr     150
A Semantic Completeness Proof for TaMeD   Richard Bonichon   Olivier Hermant     167
Saturation Up to Redundancy for Tableau and Sequent Calculi   Martin Giese     182
Branching-Time Temporal Logic Extended with Qualitative Presburger Constraints   Laura Bozzelli   Regis Gascon     197
Combining Supervaluation and Degree Based Reasoning Under Vagueness   Christian G. Fermuller   Robert Kosik     212
A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes   Boris Motik   Ulrike Sattler     227
A Local System for Intuitionistic Logic   Alwen Tiu     242
CIC^: Type-Based Termination of Recursive Definitions in the Calculus of Inductive Constructions   Gilles Barthe   Benjamin Gregoire   Fernando Pastawski     257
Reducing Nondeterminism in the Calculus of Structures   Ozan Kahramanogullari     272
A Relaxed Approach to Integrity and Inconsistency in Databases   Hendrik Decker   Davide Martinenghi     287
On Locally Checkable Properties   Orna Kupferman    Yoad Lustig   Moshe Y. Vardi     302
Deciding Key Cycles for Security Protocols   Veronique Cortier   Eugen Zalinescu     317
Automating Verification of Loops by Parallelization   Tobias Gedell   Reiner Hahnle     332
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems   Christel Baier   Nathalie Bertrand   Philippe Schnoebelen     347
Verification Condition Generation Via Theorem Proving   John Matthews   J. Strother Moore   Sandip Ray   Daron Vroon     362
An Incremental Approach to Abstraction-Carrying Code   Elvira Albert   Puri Arenas   German Puebla     377
Context-Sensitive Multivariant Assertion Checking in Modular Programs   Pawel Pietrzak   Jesus Correas   German Puebla   Manuel V. Hermenegildo     392
Representation of Partial Knowledge and Query Answering in Locally Complete Databases   Alvaro Cortes-Calabuig   Marc Denecker   Ofer Arieli   Maurice Bruynooghe     407
Sequential, Parallel, and Quantified Updates of First-Order Structures   Philipp Rummer     422
Representing Defaults and Negative Information Without Negation-as-Failure   Pablo R. Fillottrani   Guillermo R. Simari     437
Constructing Camin-Sokal Phylogenies Via Answer Set Programming   Jonathan Kavanagh   David Mitchell   Eugenia Ternovska   Jan Manuch   Xiaohong Zhao   Arvind Gupta     452
Automata for Positive Core XPath Queries on Compressed Documents   Barbara Fila   Siva Anantharaman     467
Boolean Rings for Intersection-Based Satisfiability   Nachum Dershowitz   Jieh Hsiang   Guan-Shieng Huang   Daher Kaiss     482
Theory Instantiation   Harald Ganzinger   Konstantin Korovin     497
Splitting on Demand in SAT Modulo Theories   Clark Barrett   Robert Nieuwenhuis   Albert Oliveras   Cesare Tinelli     512
Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis   Roberto Bruttomesso   Alessandro Cimatti   Anders Franzen   Alberto Griggio   Roberto Sebastiani     527
Automatic Combinability of Rewriting-Based Satisfiability Procedures   Helene Kirchner   Silvio Ranise   Christophe Ringeissen   Duc-Khanh Tran     542
To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in SMT(EUF [Characters not reproducible] T)   Roberto Bruttomesso   Alessandro Cimatti   Anders Franzen   Alberto Griggio   Alessandro Santuari   Roberto Sebastiani     557
Lemma Learning in the Model Evolution Calculus   Peter Baumgartner   Alexander Fuchs   Cesare Tinelli     572
Author Index     587
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)