Sciweavers

1020 search results - page 40 / 204
» Tight Semantics for Logic Programs
Sort
View
AMAST
1998
Springer
14 years 1 months ago
Type Analysis for CHIP
Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Wlodzimierz Drabent, Pawel Pietrzak
ESOP
2010
Springer
14 years 6 months ago
A Hoare Logic for the Coinductive Trace-Based Big-Step Semantics of While
In search for a foundational framework for reasoning about observable behavior of programs that may not terminate, we have previously devised a trace-based big-step semantics for W...
Keiko Nakata and Tarmo Uustalu
TABLEAUX
1997
Springer
14 years 28 days ago
ileanTAP: An Intuitionistic Theorem Prover
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an...
Jens Otten
AOSD
2010
ACM
14 years 3 months ago
EffectiveAdvice: disciplined advice with explicit effects
Advice is a mechanism, widely used in aspect-oriented languages, that allows one program component to augment or modify the behavior of other components. When advice and other com...
Bruno C. d. S. Oliveira, Tom Schrijvers, William R...
NMR
2004
Springer
14 years 2 months ago
Logic programs with annotated disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog...