764 search results - page 16 / 153 » On the Expressibility of Stable Logic Programming |
166
Voted
IJAR
2008
15 years 5 months ago
2008
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
153
click to vote
ICLP
2007
Springer
15 years 11 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
150
Voted
LPNMR
2004
Springer
15 years 10 months ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
128
click to vote
IJCAI
2003
15 years 6 months ago
2003
We solve the problem of obtaining answers to queries posed to a mediated integration system un der the local-as-view paradigm that are consistent wrt to certain global integrity...
151
click to vote
IJCAI
2007
15 years 6 months ago
2007
In the context of the Semantic Web, several approaches to the combination of ontologies, given in terms of theories of classical first-order logic, and rule bases have been propo...