Logic for Programming, Artificial Intelligence, and Reasoning: 12th International Conference, LPAR 2005, Montego Bay, Jamaica, December 2-6, 2005, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$140.13
(Save 21%)
Eligible for FREE SHIPPING details
Usually ships within 24 hours details
Used and New from Other Sellers
Used and New from Other Sellers
from $25.40
Usually ships in 1-2 business days
(Save 85%)
Other sellers (Paperback)
  • All (5) from $25.40   
  • New (4) from $119.33   
  • Used (1) from $25.40   

More About This Textbook

Overview

This book constitutes the refereed proceedings of the 12th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR 2005, held in Montego Bay, Jamaica in December 2005.

The 46 revised full papers presented together with abstracts of 3 invited talks were carefully reviewed and selected from 108 full paper submissions. The papers address all current issues in logic programming, logic-based program manipulation, formal method, automated reasoning, and various kinds of AI logics.

Read More Show Less

Product Details

Table of Contents

Independently checkable proofs from decision procedures : issues and progress 1
Zap : automated theorem proving for software analysis 2
Decision procedures for SAT, SAT modulo theories and beyond. The barcelogic tools 23
Scaling up : computers vs. common sense 47
A new constraint solver for 3D lattices and its application to the protein folding problem 48
Disjunctive constraint lambda calculi 64
Computational issues in exploiting dependent and-parallelism in logic programming : leftness detection in dynamic search trees 79
The nomore++ approach to answer set solving 95
Optimizing the runtime processing of types in polymorphic logic programming languages 110
The four sons of Penrose 125
An algorithmic account of Ehrenfeucht games on labeled successor structures 139
Second-order principles in specification languages for object-oriented programs 154
Strong normalization of the dual classical sequent calculus 169
Termination of fair computations in term rewriting 184
On confluence of infinitary combinatory reduction systems 199
Matching with regular constraints 215
Recursive path orderings can also be incremental 230
Automating coherent logic 246
The theorema environment for interactive proof development 261
A first order extension of Stalmarck's method 276
Regular derivations in basic superposition-based calculi 292
On the finite satisfiability problem for the guarded fragment with transitivity 307
Deciding separation logic formulae by SAT and incremental negative cycle elimination 322
Monotone AC-tree automata 337
On the specification of sequent systems 352
Verifying and reflecting quantifier elimination for presburger arithmetic 367
Integration of a software model checker into isabelle 381
Experimental evaluation of classical automata constructions 396
Automatic validation of transformation rules for Java verification against a rewriting semantics 412
Reasoning about incompletely defined programs 427
Model checking abstract state machines with answer set programming 443
Characterizing provability in Bl's pointer logic through resource graphs 459
A unified memory model for pointers 474
Treewidth in verification : local vs. global 489
Pushdown module checking 504
Functional correctness proofs of encryption algorithms 519
Towards automated proof support for probabilistic distributed systems 534
Algebraic intruder deductions 549
Satisfiability checking for PC(ID) 565
Pool resolution and its relation to regular resolution and DPLL with clause learning 580
Another complete local search method for SAT 595
Inference from controversial arguments 606
Programming cognitive agents in defeasible logic 621
The relationship between reasoning about privacy and default logics 637
Comparative similarity, tree automata, and diophantine equations 651
Analytic tableaux for KLM preferential and cumulative logics 666
Bounding resource consumption with godel-dummett logics 682
On interpolation in existence logics 697
Incremental integrity checking : limitations and possibilities 712
Concepts of automata construction from LTL 728
Read More Show Less

Customer Reviews

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

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Review Guidelines
Add Recommendations
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

Reminder:

  • - 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)