107 search results - page 2 / 22 » Reducing Propositional Theories in Equilibrium Logic to Logi... |
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
LPNMR
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
APAL
2005
13 years 5 months ago
2005
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
LPNMR
2007
Springer
13 years 11 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
ICLP
2009
Springer
14 years 6 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...