764 search results - page 2 / 153 » On the Expressibility of Stable Logic Programming |
ECSQARU
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
RR
2009
Springer
13 years 11 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
ILP
2001
Springer
13 years 9 months ago
2001
Springer
In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models ...
AAAI
1990
13 years 6 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
AMAI
2008
Springer
13 years 5 months ago
2008
Springer
The paper studies the relationship between logic programs with the stable model semantics and difference logic recently considered in the Satisfiability Modulo Theories framework....