Sciweavers

1278 search results - page 47 / 256
» On the Semantics of Logic Program Composition
Sort
View
LPNMR
2007
Springer
14 years 1 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 1 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, ...
AGP
1997
IEEE
13 years 12 months ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...
LPNMR
2004
Springer
14 years 1 months 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...
RR
2009
Springer
14 years 2 months ago
A Reasoner for Simple Conceptual Logic Programs
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
Stijn Heymans, Cristina Feier, Thomas Eiter