Sciweavers

764 search results - page 44 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
BIRTHDAY
2003
Springer
14 years 1 months ago
From CTL to Datalog
We provide a translation from CTL to Datalog¬ Succ. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and it...
Foto N. Afrati, Theodore Andronikos, Vassia Pavlak...
SLP
1994
89views more  SLP 1994»
13 years 9 months ago
Signed Logic Programs
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
Hudson Turner
JUCS
2006
135views more  JUCS 2006»
13 years 8 months ago
Operational/Interpretive Unfolding of Multi-adjoint Logic Programs
Abstract: Multi-adjoint logic programming represents a very recent, extremely flexible attempt for introducing fuzzy logic into logic programming. In this setting, the execution of...
Pascual Julián, Ginés Moreno, Jaime ...
AGP
2010
IEEE
14 years 1 months ago
Constraint Logic Programming
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...
Marco Gavanelli, Francesca Rossi
PLPV
2012
ACM
12 years 3 months ago
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...
Alan Jeffrey