Sciweavers

49 search results - page 2 / 10
» Uniform Equivalence of Logic Programs under the Stable Model...
Sort
View
LPNMR
2004
Springer
14 years 7 days ago
Simplifying Logic Programs Under Uniform and Strong Equivalence
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
LPNMR
2007
Springer
14 years 1 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
FOIKS
2008
Springer
13 years 8 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
LPNMR
2001
Springer
13 years 11 months ago
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for suc...
Thomas Lukasiewicz
ILP
2001
Springer
13 years 11 months ago
Induction of Stable Models
In the line of previous work by S. Muggleton and C. Sakama, we extend the logical characterization of inductive logic programming, to normal logic programs under the stable models ...
Ramón P. Otero