Sciweavers

ICLP
1995
Springer
13 years 8 months ago
Variants of the Event Calculus
Abstract. The Event Calculus is a narrative based formalism for reasoning about actions and change originally proposed in logic programming form by Kowalski and Sergot. In this pap...
Fariba Sadri, Robert A. Kowalski
ICLP
1995
Springer
13 years 8 months ago
Operational Semantics of Constraint Logic Programs with Coroutining
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
Andreas Podelski, Gert Smolka
ICLP
1995
Springer
13 years 8 months ago
Using Attributed Variables in the Implementation of Concurrent and Parallel Logic Programming Systems
Incorporating the possibility of attaching attributes to variables in a logic programming system has been shown to allow the addition of general constraint solving capabilities to...
Manuel V. Hermenegildo, Daniel Cabeza Gras, Manuel...
ICLP
1995
Springer
13 years 8 months ago
WAMCC: Compiling Prolog to C
We present the wamcc system, a Prolog compiler that translates Prolog to C via the WAM. This approach has some interesting consequences: simplicity, efficiency, portability, exten...
Philippe Codognet, Daniel Diaz
ICLP
1995
Springer
13 years 8 months ago
Experimenting with Nonmonotonic Reasoning
In this paper, we describe a system, called TheoryBase, whose goal is to facilitate experimental studies of nonmonotonic reasoning systems. TheoryBase generates test default theor...
Pawel Cholewinski, V. Wiktor Marek, Artur Mikitiuk...
ICLP
1995
Springer
13 years 8 months ago
A Method for Implementing Equational Theories as Logic Programs
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
Mantis H. M. Cheng, Douglas Stott Parker Jr., Maar...
ICLP
1995
Springer
13 years 8 months ago
Type Inferencing for Polymorphic Order-Sorted Logic Programs
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
Christoph Beierle