Sciweavers

19 search results - page 2 / 4
» Logic programs with propositional connectives and aggregates
Sort
View
ICFP
2012
ACM
11 years 8 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
ICLA
2011
Springer
12 years 9 months ago
A Stochastic Interpretation of Propositional Dynamic Logic: Expressivity
We propose a probabilistic interpretation of Propositional Dynamic Logic (PDL). We show that logical and behavioral equivalence are equivalent over general measurable spaces. This...
Ernst-Erich Doberkat
AI
2006
Springer
13 years 5 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
AAAI
1990
13 years 7 months ago
Computing Stable Models by Using the ATMS
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
Kave Eshghi
LPNMR
2007
Springer
13 years 12 months ago
General Default Logic
Abstract. In this paper, we present a logic R for rule bases by introducing a set of rule connectives. We define both the models and extensions of a rule base. The semantics of ex...
Yi Zhou, Fangzhen Lin, Yan Zhang