AbstractWe extend Horn Clause Prolog with two new primitives, new_engine (+Goal, +Answer, -Engine) and new_answer(+Engine, -Answer) for creating and exploring answer spaces of multiple interpreters (engines). We show that despite its ontological parsimony, the resulting language is comparable in practical expressiveness with conventional full Prolog, by allowing compact definitions for negation, if-then-else, all solution predicates, I/O and reflective meta-interpreters. While not really needed anymore as a workaround for the lack of expressiveness of pure Prolog, a form of dynamic database operations can be emulated as well, using the state of multiple engines. With multiple engines laying the foundation for multi-threaded execution models...
AbstractThis paper introduces extended programs and extended goals for logic programming. A clause i...
The feasibility of using Horn clauses as a means of describing and transforming imperative pro-grams...
The foundation of Prolog's success is the high abstraction level of its declarative subset, nam...
We take a fresh, "clean-room" look at implementing Prolog by deriving its translation to an executab...
AbstractThere has been active work to extend the Prolog style Horn clause logic programming to non-H...
AbstractThis paper presents hornlog, a general Horn-clause proof procedure that can be used to inter...
AbstractIn the Prolog language, Horn clauses of first-order logic are regarded as programs, and the ...
The implementation of Prolog systems has a long history, from the first interpreter written in 1972 ...
AbstractA logic program consists of a set of Horn clauses, and can be used to express a query on rel...
AbstractThis paper makes two contributions. First, we give a semantics for sets of clauses of the sy...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
AbstractThe paper deals with the problem of extending positive Horn clause logic by introducing impl...
AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of...
Logic programming is one of the main paradigms in the area of declarative programming. Often it is i...
Pure horn logic does not prescribe any inference strategy. Clauses could be applied in forward and b...
AbstractThis paper introduces extended programs and extended goals for logic programming. A clause i...
The feasibility of using Horn clauses as a means of describing and transforming imperative pro-grams...
The foundation of Prolog's success is the high abstraction level of its declarative subset, nam...
We take a fresh, "clean-room" look at implementing Prolog by deriving its translation to an executab...
AbstractThere has been active work to extend the Prolog style Horn clause logic programming to non-H...
AbstractThis paper presents hornlog, a general Horn-clause proof procedure that can be used to inter...
AbstractIn the Prolog language, Horn clauses of first-order logic are regarded as programs, and the ...
The implementation of Prolog systems has a long history, from the first interpreter written in 1972 ...
AbstractA logic program consists of a set of Horn clauses, and can be used to express a query on rel...
AbstractThis paper makes two contributions. First, we give a semantics for sets of clauses of the sy...
This paper considers, in a general setting, an axiomatic basis for Horn clause logic program-ming. I...
AbstractThe paper deals with the problem of extending positive Horn clause logic by introducing impl...
AbstractWe give a model-theoretic semantics for the logic of higher-order Horn clauses, the basis of...
Logic programming is one of the main paradigms in the area of declarative programming. Often it is i...
Pure horn logic does not prescribe any inference strategy. Clauses could be applied in forward and b...
AbstractThis paper introduces extended programs and extended goals for logic programming. A clause i...
The feasibility of using Horn clauses as a means of describing and transforming imperative pro-grams...
The foundation of Prolog's success is the high abstraction level of its declarative subset, nam...