Sciweavers

4126 search results - page 70 / 826
» Set based logic programming
Sort
View
RTA
2010
Springer
15 years 1 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
OWLED
2007
14 years 11 months ago
Reasoning with OWL-DL in Inductive Logic Programming
The use of background knowledge and the adoption of Horn clausal logic as a knowledge representation and reasoning framework are the distinguishing features of Inductive Logic Prog...
Francesca A. Lisi
EPIA
1995
Springer
15 years 1 months ago
A Model Theory for Paraconsistent Logic Programming
We provide a nine-valued logic to characterize the models of logic programs under a paraconsistent well-founded semantics with explicit negation WFSX p. We define a truth-function...
Carlos Viegas Damásio, Luís Moniz Pe...
LPKR
1997
Springer
15 years 1 months ago
Generalizing Updates: From Models to Programs
Abstract. Recently the field of theory update has seen some improvement, in what concerns model updating, by allowing updates to be specified by so-called revision programs. The ...
João Alexandre Leite, Luís Moniz Per...
ICLP
1994
Springer
15 years 1 months ago
Splitting a Logic Program
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...
Vladimir Lifschitz, Hudson Turner