Logic for Programming, Artificial Intelligence, and Reasoning: 10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003, 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 $14.99
Usually ships in 1-2 business days
(Save 88%)
Other sellers (Paperback)
  • All (10) from $14.99   
  • New (5) from $95.61   
  • Used (5) from $14.99   


This book constitutes the refereed proceedings of the 10th International Conference on Logic Programming, Artificial Intelligence, and Reasoning, LPAR 2003, held in Almaty, Kazakhstan in September 2003.

The 27 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 65 submissions. The papers address all current issues in logic programming, automated reasoning, and AI logics in particular description logics, proof theory, logic calculi, formal verification, model theory, game theory, automata, proof search, constraint systems, model checking, and proof construction.

Read More Show Less

Product Details

Table of Contents

From Tableaux to Automata for Description Logics.- Disproving False Conjectures.- A Formal Proof of Dickson’s Lemma in ACL2.- Imperative Object-Based Calculi in Co-inductive Type Theories.- Congruence Closure with Integer Offsets.- A Machine-Verified Code Generator.- A Translation Characterizing the Constructive Content of Classical Theories.- Extensions of Non-standard Inferences to Description Logics with Transitive Roles.- Extended Canonicity of Certain Topological Properties of Set Spaces.- Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics.- Improving Dependency Pairs.- On Closure under Complementation of Equational Tree Automata for Theories Extending AC.- Completeness of E-Unification with Eager Variable Elimination.- Computable Numberings.- Handling Equality in Monodic Temporal Resolution.- Once upon a Time in the West.- Ordered Diagnosis.- Computing Preferred Answer Sets in Answer Set Programming.- A Syntax-Based Approach to Reasoning about Actions and Events.- Minimizing Automata on Infinite Words.- Gandy’s Theorem for Abstract Structures without the Equality Test.- Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems.- NP-Completeness Results for Deductive Problems on Stratified Terms.- Is Cantor’s Theorem Automatic?.- Automatic Structures of Bounded Degree.- An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems.- A Logical Study on Qualitative Default Reasoning with Probabilities.- On Structuring Proof Search for First Order Linear Logic.- Strict Geometry of Interaction Graph Models.- Connection-Based Proof Construction in Non-commutative Logic.

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)