Logic Programming: Proceedings of the 1999 International Conference on Logic ProgrammingDanny De Schreye Includes tutorials, lectures, and refereed papers on all aspects of logic programming, including theoretical foundations, constraints, concurrency and parallelism, deductive databases, language design and implementation, nonmonotonic reasoning, and logic programming and the Internet. The International Conference on Logic Programming, sponsored by the Association for Logic Programming, includes tutorials, lectures, and refereed papers on all aspects of logic programming, including theoretical foundations, constraints, concurrency and parallelism, deductive databases, language design and implementation, nonmonotonic reasoning, and logic programming and the Internet. |
Contents
Logics and Database Modeling | 6 |
Adventures in the Prolog Trade | 22 |
Logic Programming in Oz with Mozart | 38 |
Program Analysis Debugging and Optimization Using the Ciao System | 52 |
From Prolog and Zelda to ToonTalk | 67 |
Disjunctive Logic Programs with Inheritance | 79 |
Event Property and Hierarchy in OrderSorted Logic | 94 |
Ken Kaneiwa and Satoshi Tojo | 108 |
Proving Termination of InputConsuming Logic Programs | 335 |
Bounded Nondeterminism of Logic Programs | 350 |
Termination Analysis for Abductive General Logic Programs | 365 |
The Relative Complement Problem for HigherOrder Patterns | 380 |
Extensionality of Simply Typed Logic Programs | 395 |
Lightweight Lemmas in AProlog | 411 |
Andrew W Appel and Amy P Felty | 424 |
Optimization of Disjunctive Queries | 441 |
An Optimized Prolog Encoding of Typed Feature Structures | 124 |
A Generic Approach to Monitor Program Executions | 139 |
Generating Deductive Database Explanations | 154 |
Computing Large and Small Stable Models | 169 |
Algebra of Logic Programming | 184 |
Semantic Definitions for Normal Open Programs | 200 |
Declarative Priority in a Concurrent Logic Language ON | 215 |
Revising Hull and Box Consistency | 230 |
Combining Sets Search and Rules to Better Express Algorithms | 245 |
Herbrand Constraint Solving in HAL | 260 |
Comparing Trailing and Copying for Constraint Programming | 275 |
OrAndparallelism on Distributed Memory Machines | 290 |
Mutable Terms in a Tabled Logic Programming System | 305 |
Concurrency in Prolog Using Threads and a Shared Database | 320 |
The Nonground Case | 456 |
Monotonicity in Rule Based Update | 471 |
Transforming Inductive Definitions | 486 |
Bindingtime Analysis for Mercury | 500 |
Solving TSP with Time Windows with Constraints | 515 |
Finding Fair Allocations for the Coalition Problem with Constraints | 530 |
Constraintbased Round Robin Tournament Planning | 545 |
Logic Programming with Requests | 558 |
ACI1 Constraints | 573 |
Declarative Pruning in a Functional Query Language | 588 |
Adding Fuctions to SICStus Prolog | 605 |
A Linear Tabling Mechanism | 618 |
Other editions - View all
Logic Programming: Proceedings of the 1999 International Conference on Logic ... Danny De Schreye No preview available - 1999 |
Common terms and phrases
ABDUAL abductive abstract algorithm answer set application argument arity atom bound choice-points clause complete computation concurrent consider consistency Constraint Logic Programming constraint programming copying database Datalog declarative defined Definition denote derivation disjunctive domain efficient encoding evaluation example execution extended Figure finite fixpoint formula function given goal ground Herbrand higher-order higher-order logic implementation inference input instance instantiation integer interpretation Lemma literal logic pro logic programming Mercury method mmap mode mutable terms negation negation as failure node operational semantics operator optimization P₁ paper pattern predicate priority problem Proc procedure programming language programs and queries Prolog proof propagation properties proves qsort recomputation rule set run-time Section selection rule semantics solution solved form stable model stack-splitting strategy structure subgoal subset symbol techniques termination Theorem ToonTalk transformation tuple unification update variables well-founded well-founded semantics