Results 1  10
of
78,501
Constraint Logic Programming with Hereditary Harrop Formulas
, 1997
"... Constraint Logic Programming (CLP) and Hereditary Harrop Formulas (HH)are two well known ways to enhance the expressivity of Horn clauses. In this paper, we present a novel combination of these two approaches. We show how to enrich the syntax and proof theory of HH with the help of a given constrain ..."
Abstract

Cited by 15 (8 self)
 Add to MetaCart
Constraint Logic Programming (CLP) and Hereditary Harrop Formulas (HH)are two well known ways to enhance the expressivity of Horn clauses. In this paper, we present a novel combination of these two approaches. We show how to enrich the syntax and proof theory of HH with the help of a given
Uniform proofs as a foundation for logic programming
 ANNALS OF PURE AND APPLIED LOGIC
, 1991
"... A prooftheoretic characterization of logical languages that form suitable bases for Prologlike programming languages is provided. This characterization is based on the principle that the declarative meaning of a logic program, provided by provability in a logical system, should coincide with its ..."
Abstract

Cited by 428 (122 self)
 Add to MetaCart
. Horn clauses are then generalized to hereditary Harrop formulas and it is shown that firstorder and higherorder versions of this new class of formulas are also abstract logic programming languages if the inference rules are those of either intuitionistic or minimal logic. The programming language
A Proof Procedure for the Logic of Hereditary Harrop Formulas
 JOURNAL OF AUTOMATED REASONING
, 1993
"... A proof procedure is presented for a class of formulas in intuitionistic logic. These formulas are the socalled goal formulas in the theory of hereditary Harrop formulas. Proof search inintuitionistic logic is complicated by the nonexistence of a Herbrandlike theorem for this logic: formulas cann ..."
Abstract

Cited by 34 (12 self)
 Add to MetaCart
A proof procedure is presented for a class of formulas in intuitionistic logic. These formulas are the socalled goal formulas in the theory of hereditary Harrop formulas. Proof search inintuitionistic logic is complicated by the nonexistence of a Herbrandlike theorem for this logic: formulas
Towards a constraint deductive database language based on hereditary harrop formulas
 Sextas Jornadas de Programación y Lenguajes, PROLE
, 2006
"... In the same way that Datalog and Datalog with constraints arise when modelling databases inspired on Prolog and CLP (Constraint Logic Programming), respectively, we introduce the constraint logic programming scheme HH(C) (Hereditary Harrop formulas with Constraints) as the basis for a database langu ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
In the same way that Datalog and Datalog with constraints arise when modelling databases inspired on Prolog and CLP (Constraint Logic Programming), respectively, we introduce the constraint logic programming scheme HH(C) (Hereditary Harrop formulas with Constraints) as the basis for a database
Logic Programming in a Fragment of Intuitionistic Linear Logic
, 1994
"... 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 of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract

Cited by 340 (44 self)
 Add to MetaCart
if they are based on linear logic. After presenting two equivalent formulations of a fragment of linear logic, we show that the fragment has a goaldirected interpretation, thereby partially justifying calling it a logic programming language. Logic programs based on the intuitionistic theory of hereditary Harrop
A semantics for logic programs based on first order hereditary Harrop formulas
"... The paper introduces a semantics for logic programs based on first order hereditary Harrop formulas which are expressed in terms of intuitionistic derivations. The derivations are constructed by means of an intuitionistic proof procedure that constitutes the resolution mechanism of the language. The ..."
Abstract
 Add to MetaCart
The paper introduces a semantics for logic programs based on first order hereditary Harrop formulas which are expressed in terms of intuitionistic derivations. The derivations are constructed by means of an intuitionistic proof procedure that constitutes the resolution mechanism of the language
Success and Failure for Hereditary Harrop Formulae
 Journal of Logic Programming
, 1993
"... We introduce the foundational issues involved in incorporating the Negation as Failure (NAF) rule into the framework of firstorder hereditary Harrop formulae of Miller et al. This is a larger class of formulae than Horn clauses, and so the technicalities are more intricate than in the Horn claus ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We introduce the foundational issues involved in incorporating the Negation as Failure (NAF) rule into the framework of firstorder hereditary Harrop formulae of Miller et al. This is a larger class of formulae than Horn clauses, and so the technicalities are more intricate than in the Horn
Implementing a Fixpoint Semantics for a Constraint Deductive Database based on Hereditary Harrop Formulas
"... This work is aimed to show a concrete implementation of a deductive database system based on the scheme HH¬(C) (Hereditary Harrop Formulas with Negation and Constraints) following a fixpoint semantics proposed in a previous work. We have developed a Prolog implementation for this scheme that is co ..."
Abstract
 Add to MetaCart
This work is aimed to show a concrete implementation of a deductive database system based on the scheme HH¬(C) (Hereditary Harrop Formulas with Negation and Constraints) following a fixpoint semantics proposed in a previous work. We have developed a Prolog implementation for this scheme
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
"... Abstract. In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint deductive database query language. In addition to constraints, our proposal includes logical connectives (implica ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint deductive database query language. In addition to constraints, our proposal includes logical connectives
ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers
 Artificial Intelligence
, 2002
"... We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a onetoone corresp ..."
Abstract

Cited by 260 (7 self)
 Add to MetaCart
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program’s completion, we obtain a one
Results 1  10
of
78,501