426 search results - page 40 / 86 » Combining Answer Sets of Nonmonotonic Logic Programs |
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
RULEML
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
SLP
1994
13 years 9 months ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
FLAIRS
2006
13 years 9 months ago
2006
The SEMEX tool for question answering is presented. Its architecture and features for extracting from input text a network of concept nodes that index syntax-based logical forms, ...
JAIR
2007
13 years 7 months ago
2007
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation fo...