24 search results - page 4 / 5 » Simplifying Logic Programs Under Uniform and Strong Equivale... |
FOSSACS
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
JAIR
2006
13 years 6 months ago
2006
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
ICLP
2009
Springer
14 years 7 months ago
2009
Springer
If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate co...
ICLP
2007
Springer
14 years 14 days ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
ECAI
2004
Springer
13 years 11 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 ...