Sciweavers

23 search results - page 1 / 5
» Testing Strong Equivalence of Datalog Programs - Implementat...
Sort
View
LANMR
2007
13 years 6 months ago
Equivalence for the G3'-stable models semantics
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
José Luis Carballido, José Arrazola,...
AAAI
1994
13 years 6 months ago
Recovering Software Specifications with Inductive Logic Programming
We consider using machine learning techniques to help understand a large software system. In particular, we describe how learning techniques can be used to reconstruct abstract Da...
William W. Cohen
ICALP
1998
Springer
13 years 9 months ago
A Hierarchy of Equivalences for Asynchronous Calculi
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
Cédric Fournet, Georges Gonthier
KR
2004
Springer
13 years 10 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
JLP
2008
91views more  JLP 2008»
13 years 4 months ago
Local variable scoping and Kleene algebra with tests
We explore the power of relational semantics and equational reasoning in the style of Kleene algebra for analyzing programs with mutable, statically scoped local variables. We prov...
Kamal Aboul-Hosn, Dexter Kozen