5506 search results - page 105 / 1102 » Minimal Logic Programs |
104
Voted
JELIA
2000
Springer
15 years 4 months ago
2000
Springer
In previous work, we developed a framework for expressing general preference information in default logic and logic programming. Here we show that the approach of Brewka and Eiter ...
114
Voted
APAL
2005
15 years 1 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...
ESOP
2009
Springer
15 years 8 months ago
2009
Springer
The operational semantics of interactive systems is usually d by labeled transition systems. Abstract semantics is defined in terms of bisimilarity that, in the finite case, can ...
107
Voted
LPAR
1999
Springer
15 years 5 months ago
1999
Springer
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
109
click to vote
LPNMR
2005
Springer
15 years 6 months ago
2005
Springer
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...