797 search results - page 49 / 160 » Eliminating Proofs from Programs |
124
click to vote
LICS
1991
IEEE
15 years 4 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
117
Voted
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In answer-set programming (ASP), many notions of program equivalence have been introduced and formally analysed. A particular line of research in this direction aims at s...
139
click to vote
AGP
2010
IEEE
15 years 4 months ago
2010
IEEE
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...
AI
2006
Springer
15 years 24 days ago
2006
Springer
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
111
Voted
NJC
2006
15 years 20 days ago
2006
Slicing is a technique for extracting parts of programs or specifications with respect to certain criteria of interest. The extraction is carried out in such a way that properties ...