194 search results - page 28 / 39 » Justifications for Logic Programs under Answer Set Semantics |
VMCAI
2007
Springer
15 years 3 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
103
click to vote
LPKR
1997
Springer
15 years 1 months 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
14 years 11 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
15 years 3 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 ...
70
Voted
ECSQARU
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The problem of merging multiple sources information is central in several domains of computer science. In knowledge representation for artificial intelligence, several a...