AbstractA constructive rationalization of PROLOG is presented, covering the logical form of definite clause programs and the role of negative (goal) clauses. This view is developed from the idea, taken from set theory, that a constructive theory can be obtained if classical reasoning is confined to a constructively limited basis. The syntax of definite clauses is seen as reflecting a constructive view of description in that it prevents the expression of incomplete and negative information; the purely negative clauses initiate a classical proof technique, operating on a definite axiomatic basis
We present constructive provability logic, an intuitionstic modal logic that validates the L¨ob rule...
We present a Prolog program - the SAT solver of Howe and King - as a (pure) logic program with added...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...
AbstractA constructive rationalization of PROLOG is presented, covering the logical form of definite...
In this paper we provide a constructive interpretation of Hoare logics with the constructive and int...
AbstractNegation has traditionally been a difficult issue in Logic Programming. Most of Prolog progr...
AbstractMints (1986) has given a deductive calculus, a set of proof rules, for pure Prolog such that...
AbstractThis paper introduces extended programs and extended goals for logic programming. A clause i...
AbstractSome logic notions have their analogies among programming concepts and vice versa. But peopl...
AbstractLogic programming is understood as the use of constructive proofs for building correct progr...
AbstractWe present the program development concept in a logical framework including constructive typ...
[EN]Programming languages seldom find proper anchorage in philosophy of logic, language and science....
AbstractWe use formal semantic analysis based on new constructions to study abstract realizability, ...
In this work, we show that both logic programming and abstract argumentation frameworks can be inter...
AbstractMany studies [1, 7, 20, 21, 26, 28] have shown the soundness and completeness of SLD-resolut...
We present constructive provability logic, an intuitionstic modal logic that validates the L¨ob rule...
We present a Prolog program - the SAT solver of Howe and King - as a (pure) logic program with added...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...
AbstractA constructive rationalization of PROLOG is presented, covering the logical form of definite...
In this paper we provide a constructive interpretation of Hoare logics with the constructive and int...
AbstractNegation has traditionally been a difficult issue in Logic Programming. Most of Prolog progr...
AbstractMints (1986) has given a deductive calculus, a set of proof rules, for pure Prolog such that...
AbstractThis paper introduces extended programs and extended goals for logic programming. A clause i...
AbstractSome logic notions have their analogies among programming concepts and vice versa. But peopl...
AbstractLogic programming is understood as the use of constructive proofs for building correct progr...
AbstractWe present the program development concept in a logical framework including constructive typ...
[EN]Programming languages seldom find proper anchorage in philosophy of logic, language and science....
AbstractWe use formal semantic analysis based on new constructions to study abstract realizability, ...
In this work, we show that both logic programming and abstract argumentation frameworks can be inter...
AbstractMany studies [1, 7, 20, 21, 26, 28] have shown the soundness and completeness of SLD-resolut...
We present constructive provability logic, an intuitionstic modal logic that validates the L¨ob rule...
We present a Prolog program - the SAT solver of Howe and King - as a (pure) logic program with added...
AbstractWe define a semantics for negation as failure in logic programming. Our semantics may be vie...