Sciweavers

1005 search results - page 9 / 201
» Operational Semantics and Program Equivalence
Sort
View
AGP
1997
IEEE
13 years 11 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é...
ENTCS
2006
121views more  ENTCS 2006»
13 years 7 months ago
A Hierarchy of SOS Rule Formats
nary abstract) Jan Friso Groote 1 MohammadReza Mousavi 2 Michel A. Reniers 3 Department of Computer Science, Eindhoven University of Technology (TU/e), P.O. Box 513, NL-5600 MB Ein...
Jan Friso Groote, Mohammad Reza Mousavi, Michel A....
JAIR
2007
108views more  JAIR 2007»
13 years 7 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen
LPNMR
2005
Springer
14 years 29 days ago
On Modular Translations and Strong Equivalence
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...
Paolo Ferraris