827 search results - page 35 / 166 » Proof-Theoretic Soundness and Completeness |
SLP
1990
13 years 8 months ago
1990
We discuss the impact of Partial Evaluation within the framework of structured logic programming. We define a general scheme for Partial Evaluation to be applied to a wide class o...
ENTCS
2010
13 years 7 months ago
2010
This paper gives an overview of two methods for automatically or semi-automatically generating deduction calculi from the semantic specification of a logic. One approach is based ...
ENTCS
2008
13 years 7 months ago
2008
We study the algebraic structure of directed bigraphs, a bigraphical model of computations with locations, connections and resources previously introduced as a unifying generaliza...
FUIN
2006
13 years 7 months ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...
JSYML
2008
13 years 7 months ago
2008
In this paper a method for the replacement, in formulas, of strong quantifiers by functions is introduced that can be considered as an alternative to Skolemization in the setting ...