1578 search results - page 9 / 316 » Induction of Stable Models |
97
Voted
LANMR
2007
15 years 4 months ago
2007
Given a propositional formula X, we present a mapping that constructs a general program P, such that the maximal models of X correspond to the stable models of P, after intersectin...
129
Voted
MEMICS
2010
14 years 9 months ago
2010
Identification in the limit, originally due to Gold [10], is a widely used computation model for inductive inference and human language acquisition. We consider a nonconstructive ...
101
click to vote
ICLP
2003
Springer
15 years 7 months ago
2003
Springer
We propose and study algorithms for computing minimal models, stable models and answer sets of 2- and 3-CNF theories, and normal and disjunctive 2- and 3-programs. We are especiall...
123
click to vote
LPNMR
2001
Springer
15 years 7 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
102
click to vote
ICLP
1999
Springer
15 years 6 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...