567 search results - page 28 / 114 » Probabilistic Reasoning With Answer Sets |
LPAR
2004
Springer
14 years 4 months ago
2004
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...
ASP
2003
Springer
14 years 4 months ago
2003
Springer
Integration of data is required when accessing multiple databases within an organization or on the WWW. Schema integration is required for database interoperability, but it is curr...
FOIKS
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Ordered Choice Logic Programming (OCLP) allows for dynamic preference-based decision-making with multiple alternatives without the need for any form of negation. This com...
ICLP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
ASP
2005
Springer
14 years 4 months ago
2005
Springer
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...