Sciweavers

60 search results - page 6 / 12
» Termination and Reduction Checking for Higher-Order Logic Pr...
Sort
View
ESWS
2009
Springer
14 years 1 months ago
Hybrid Reasoning with Forest Logic Programs
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
Cristina Feier, Stijn Heymans
AGP
2010
IEEE
13 years 10 months ago
The Transformational Approach to Program Development
We present an overview of the program transformation techniques which have been proposed over the past twenty-five years in the context of logic programming. We consider the appro...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
ICLP
2005
Springer
14 years 6 days ago
Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...
Hans Tompits, Stefan Woltran
JUCS
2006
104views more  JUCS 2006»
13 years 6 months ago
Constructive Failure in Functional-Logic Programming: From Theory to Implementation
: Functional-logic programming amalgamates some of the main features of both functional and logic styles into a single paradigm. Nevertheless, negation is a widely investigated fea...
Jaime Sánchez-Hernández
TACAS
2005
Springer
124views Algorithms» more  TACAS 2005»
14 years 5 days ago
Dynamic Symmetry Reduction
Abstract. Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the proh...
E. Allen Emerson, Thomas Wahl