Sciweavers

1020 search results - page 31 / 204
» Tight Semantics for Logic Programs
Sort
View
AAAI
1998
13 years 10 months ago
Fixpoint 3-Valued Semantics for Autoepistemic Logic
The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and de ne the semantics as its least xpoint. The semantics is...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...
ECSQARU
2009
Springer
14 years 3 months ago
Merging Belief Bases Represented by Logic Programs
Abstract. This paper presents a method which allows for merging beliefs expressed thanks to logic programming with stable model semantics. This method is based on the syntactic mer...
Julien Hué, Odile Papini, Eric Würbel
DEXAW
2008
IEEE
93views Database» more  DEXAW 2008»
14 years 3 months ago
Overlay GHC: An Extension of Guarded Horn Clauses for Overlay Programming
Today’s high-speed network allows sophisticated applications of overlay networks. Meanwhile, usage of multicore processors has been spreading. The level of concurrency we need t...
Kenji Saito
LPNMR
2007
Springer
14 years 2 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
PPDP
2005
Springer
14 years 2 months ago
Monadic concurrent linear logic programming
Lolli is a logic programming language based on the asynchronous propositions of intuitionistic linear logic. It uses a backward chaining, backtracking operational semantics. In th...
Pablo López, Frank Pfenning, Jeff Polakow, ...