201 search results - page 29 / 41 » Merging Logic Programs under Answer Set Semantics |
LPKR
1997
Springer
14 years 23 days ago
1997
Springer
The purpose of this paper is to investigate the methodology of reasoning with prioritized defaults in the language of logic programs under the answer set semantics. We present a do...
IJCAI
2007
13 years 10 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...
LPNMR
2005
Springer
14 years 2 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
ICLP
2007
Springer
14 years 2 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...
IJCAI
1997
13 years 10 months ago
1997
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized c...