Sciweavers

180 search results - page 15 / 36
» Declarative Semantics of Input Consuming Logic Programs
Sort
View
LPNMR
2004
Springer
14 years 27 days 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...
ICLP
2004
Springer
14 years 28 days ago
Termination of Logic Programs Using Various Dynamic Selection Rules
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
Jan-Georg Smaus
CORR
2006
Springer
135views Education» more  CORR 2006»
13 years 7 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...
META
1992
13 years 11 months ago
Logic Meta-Programming Facilities in 'LOG
A meta-level extension of a logic programming language is presented. The resulting language, called 'LOG (read quote-log), provides meta-programming facilities similar to thos...
Iliano Cervesato, Gianfranco Rossi
AGP
1998
IEEE
13 years 11 months ago
Some Design Issues in the Visualization of Constraint Logic Program Execution
Visualization of program executions has been found useful in applications which include education and debugging. However, traditional visualization techniques often fall short of ...
Manuel Carro, Manuel V. Hermenegildo