561 search results - page 53 / 113 » Slicing of Constraint Logic Programs |
152
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
175
Voted
LICS
1995
IEEE
15 years 7 months ago
1995
IEEE
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
132
Voted
SIGSOFT
2009
ACM
16 years 4 months ago
2009
ACM
Parallel changes are becoming increasingly prevalent in the development of large scale software system. To further study the relationship between parallel changes and faults, we h...
131
Voted
ICFP
2004
ACM
16 years 3 months ago
2004
ACM
Recent functional logic languages such as Curry and Toy combine lazy functional programming with logic programming features including logic variables, non-determinism, unification...
107
Voted
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...