87 search results - page 5 / 18 » On Reachability of Minimal Models of Multilattice-Based Logi... |
AAAI
2000
13 years 8 months ago
2000
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
LPNMR
2001
Springer
13 years 11 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...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a purely model-theoretic semantics for disjunctive logic programs with negation, building on the infinite-valued approach recently introduced for normal logic...
WSC
2007
13 years 9 months ago
2007
There has long been a competition between simulation and optimization in the modeling of problems in transportation and logistics, machine scheduling and similar highdimensional p...
LPKR
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. We study the relationship between argumentation (abduction) and disjunctive logic programming. Based on the paradigm of argumentation, an abductive semantic framework for...