Sciweavers

764 search results - page 15 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
ICLP
2005
Springer
14 years 1 months ago
Hybrid Probabilistic Logic Programs with Non-monotonic Negation
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...
Emad Saad, Enrico Pontelli
LPNMR
2001
Springer
14 years 15 days 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
LPNMR
2007
Springer
14 years 2 months ago
Head-Elementary-Set-Free Logic Programs
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
Martin Gebser, Joohyung Lee, Yuliya Lierler
FORTE
2010
13 years 9 months ago
Heap-Dependent Expressions in Separation Logic
Abstract. Separation logic is a popular specification language for imperative programs where the heap can only be mentioned through pointsto assertions. However, separation logic&#...
Jan Smans, Bart Jacobs, Frank Piessens
AMAI
2006
Springer
13 years 8 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...