308 search results - page 12 / 62 » Answer Set Programming Based on Propositional Satisfiability |
107
Voted
AAAI
2008
15 years 2 months ago
2008
Probabilistic logic programming is a powerful technique to represent and reason with imprecise probabilistic knowledge. A probabilistic logic program (PLP) is a knowledge base whi...
92
Voted
AUSAI
2007
Springer
15 years 3 months ago
2007
Springer
Planning as satisfiability is a powerful approach to solving domain independent planning problems. In this paper, we consider a relaxed semantics for plans with parallel operator a...
LPNMR
2005
Springer
15 years 5 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
132
click to vote
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
The paper discusses some innovative aspects related to the integration of a framework based on Answer Set Programming in an Information Retrieval Agent, namely, the Global Search A...