567 search results - page 55 / 114 » Probabilistic Reasoning With Answer Sets |
NMR
2004
Springer
15 years 3 months ago
2004
Springer
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
DLOG
2006
14 years 11 months ago
2006
In our case study we investigate a server for answering OWLQL queries with distinguished variables only (henceforth called OWLQL). This server acts as a proxy that delegates queri...
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
104
click to vote
ASP
2005
Springer
15 years 3 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
ICLP
2004
Springer
15 years 3 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...