Logic for Programming, Artificial Intelligence, and Reasoning

8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings

By: Robert Nieuwenhuis (Editor), Andrei Voronkov (Editor)

Write A Review

Paperback | 21 November 2001

At a Glance

Paperback
760 Pages

Dimensions(cm)
22.86 x 15.24 x 2.54

Paperback

$169.00

or 4 interest-free payments of $42.25 with

Ships in 5 to 7 business days

This volume contains the papers presented at the Eighth International C- ference on Logic for Programming, Arti?cial Intelligence and Reasoning (LPAR 2001), held on December 3-7, 2001, at the University of Havana (Cuba), together with the Second International Workshop on Implementation of Logics. There were 112 submissions, of which 19 belonged to the special subm- sion category of experimental papers, intended to describe implementations or comparisons of systems, or experiments with systems. Each submission was - viewed by at least three program committee members and an electronic program committee meeting was held via the Internet. The high number of submissions caused a large amount of work, and we are very grateful to the other 31 PC members for their e?ciency and for the quality of their reviews and discussions. Finally, the committee decided to accept 40papers in the theoretical ca- gory, and 9 experimental papers. In addition to the refereed papers, this volume contains an extended abstract of the invited talk by Frank Wolter. Two other invited lectures were given by Matthias Baaz and Manuel Hermenegildo. Apart from the program committee, we would also like to thank the other people who made LPAR 2001 possible: the additional referees; the Local Arran- ` gements Chair Luciano Garc´?a; Andr´es Navarro and Oscar Guell, ¨ who ran the internet-based submission software and the program committee discussion so- ware at the LSI Department lab in Barcelona; and Bill McCune, whose program committee management software was used.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Artificial Intelligence Medicine Medicine in General Computer Programming & Software Development Software Engineering Mathematics Mathematical Foundation Mathematical Logic Computer Architecture & Logic Design

Invited Talk
Monodic Fragments of First-Order Temporal Logics: 2000-2001 A.D	p. 1
Verification
On Bounded Specifications	p. 24
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy	p. 39
Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets	p. 55
Guarded Logics
Games and Model Checking for Guarded Logics	p. 70
Computational Space Efficiency and Minimal Model Generation for Guarded Formulae	p. 85
Agents
	p. 100
Local Conditional High-Level Robot Programs	p. 110
A Refinement Theory That Supports Reasoning about Knowledge and Time for Synchronous Agents	p. 125
Automated Theorem Proving
Proof and Model Generation with Disconnection Tableaux	p. 142
Counting the Number of Equivalent Binary Resolution Proofs	p. 157
Automated Theorem Proving
Splitting through New Proposition Symbols	p. 172
Complexity of Linear Standard Theories	p. 186
Herbrand's Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving	p. 201
Non-classical Logics
Unification in a Description Logic with Transitive Closure of Roles	p. 217
Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions	p. 233
Types
Coherence and Transitivity in Coercive Subtyping	p. 249
A Type-Theoretic Approach to Induction with Higher-Order Encodings	p. 266
Analysis of Polymorphically Typed Logic Programs Using ACI-Unification	p. 282
Experimental Papers
	p. 299
First-Order Atom Definitions Extended	p. 309
Automated Proof Support for Interval Logics	p. 320
Foundations of Logic
The Functions Provable by First Order Abstraction	p. 330
A Local System for Classical Logic	p. 347
CSP and SAT
Partial Implicit Unfolding in the Davis-Putnam Procedure for Quantified Boolean Formulae	p. 362
Permutation Problems and Channelling Constraints	p. 377
Simplifying Binary Propositional Theories into Connected Components Twice as Fast	p. 392
Non-monotonic Reasoning
Reasoning about Evolving Nonmonotonic Knowledge Bases	p. 407
Efficient Computation of the Well-Founded Model Using Update Propagation	p. 422
Semantics
Indexed Categories and Bottom-Up Semantics of Logic Programs	p. 438
Functional Logic Programming with Failure: A Set-Oriented View	p. 455
Operational Semantics for Fixed-Point Logics on Constraint Databases	p. 470
Experimental Papers
Efficient Negation Using Abstract Interpretation	p. 485
Certifying Synchrony for Free	p. 495
A Computer Environment for Writing Ordinary Mathematical Proofs	p. 507
Termination
On Termination of Meta-programs	p. 517
A Monotonic Higher-Order Semantic Path Ordering	p. 531
Knowledge-Based Systems
The Elog Web Extraction Language	p. 548
Census Data Repair: A Challenging Application of Disjunctive Logic Programming	p. 561
Analysis of Logic Programs
Boolean Functions for Finite-Tree Dependencies	p. 579
How to Transform an Analyzer into a Verifier	p. 595
Andorra Model Revised: Introducing Nested Domain Variables and a Targeted Search	p. 610
Databases and Knowledge Bases
Coherent Composition of Distributed Knowledge-Bases through Abduction	p. 624
Tableaux for Reasoning about Atomic Updates	p. 639
Termination
Inference of Termination Conditions for Numerical Loops in Prolog	p. 654
Termination of Rewriting with Strategy Annotations	p. 669
Inferring Termination Conditions for Logic Programs Using Backwards Analysis	p. 685
Program Analysis and Proof Planning
Reachability Analysis of Term Rewriting Systems with Timbuk	p. 695
Binding-Time Annotations without Binding-Time Analysis	p. 707
Concept Formation via Proof Planning Failure	p. 723
Author Index	p. 737
Table of Contents provided by Publisher. All Rights Reserved.

Logic for Programming, Artificial Intelligence, and Reasoning

8th International Conference, LPAR 2001, Havana, Cuba, December 3-7, 2001, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Artificial Intelligence

Don't Burn Anyone at the Stake Today

(and other lessons from history about living through an information crisis)

The Laws of Thought

The Quest for a Mathematical Theory of the Mind

Nexus

A Brief History of Information Networks from the Stone Age to AI

If Anyone Builds It, Everyone Dies

The Case Against Superintelligent AI

The AI-Driven Leader

Harnessing AI to Make Faster, Smarter Decisions

The AI Con

How To Fight Big Tech's Hype and Create the Future We Want

Hope in the Library

How Libraries Can Help Shape Our Future with Artificial Intelligence

The ChatGPT Revolution

2nd Edition - Get Curious, Get Productive and Get Creative with AI

A Practitioner's Guide to Advancing Behavioral Health Care with Artificial Intelligence

AI for Business

A Guide to AI Adoption

GPT Meets Game Theory

Training and Optimizing Generative AI Models

Smart Technologies and Intelligent Computing

Cultural Intelligence in Aviation

Bridging Social Attitudes, Culture, and Safety in a Global Environment

Fluid Mechanics in the Digital Era

Advanced Concepts and Applications

Agentic AI For Dummies

For Dummies (Computer/Tech)

Artificial Intelligence and Large Language Models

A Scientific Perspective

Using Psychoanalysis to Understand and Address AI Bias

Refractions in the Digital Mirror

Feature Selection and Feature Extraction on Omics Data

The Singularity is Nearer

When We Merge with AI

The Challenge of the Future

What Should We Keep from Yesterday as We Rush into Tomorrow?

REVOLUTIONIZING DRUG DEVELOPMENT

HARNESSING AI AND COMPUTATIONAL BIOLOGY

The Ultimate ChatGPT Prompt Book

750+ Expert Prompts to Boost Productivity, Unlock Creative Potential, and Simplify Tasks

AI and Data Science in Healthcare 5.0

Medical Robots and Devices: New Developments and Advances

Wearable Exoskeleton Systems

Design, Control and Applications

This product is categorised by