Generalized Earley Deduction and Its Correctness

@inproceedings{Beckstein1991GeneralizedED,
  title={Generalized Earley Deduction and Its Correctness},
  author={Clemens Beckstein and Michelle Y. Kim},
  booktitle={GWAI},
  year={1991}
}
This paper describes a deduction method that works both top-down and bottom-up. The method can be viewed as an extension of a well-known approach—Earley deduction—to handle negation-as-failure. We show that with respect to the stratified model theory of [1] the method is sound, that it is strongly complete (terminating) for function-free programs with negation, and complete for programs without negation if function symbols are allowed. 

Putting Declarative Meta Control to Work

A logic programming system that accomplishes equivalence of declarative and operational semantics,Declarative specification of control information, and smoothness of interaction with nonlogic-based programs is presented.

Putting Declarative Meta Control to Work ; CU-CS-856-98

A logic programming system that accomplishes equivalence of declarative and operational semantics,Declarative specification of control information, and smoothness of interaction with nonlogic-based programs is presented.

Putting Declarative Meta Control to Work Apollo Hogan and

A logic programming system that accomplishes equivalence of declarative and operational semantics,Declarative specification of control information, and smoothness of interaction with nonlogic-based programs is presented.

Meta-Programming for Generalized Horn Clause

This paper argues that in order to comply with the logic programming paradigm, control information should also be expressed declaratively, and introduces meta level control clauses that allow clause determinism to be expressed.

Declarative Meta Level Controlfor Logic

This paper argues that in order to comply with the logic programming paradigm, control information should also be expressed declaratively, and introduces meta level control clauses that allow clause determinism to be expressed.

Agenda control for heterogeneous reasoners

References

SHOWING 1-10 OF 14 REFERENCES

Parsing as Deduction

By exploring the relationship between parsing and deduction, a new and more general view of chart parsing is obtained, which encompasses parsing for grammar formalisms based on unification, and is

Foundations of deductive databases and logic programming

This book discusses Negation in Logic Programming, a Theory of Declarative Knowledge, and its Applications in Deductive Databases and Implementation, as well as other topics.

An efficient context-free parsing algorithm

A parsing algorithm which seems to be the most efficient general context-free algorithm known is described and appears to be superior to the top-down and bottom-up algorithms studied by Griffiths and Petrick.

Bottom-up beats top-down for datalog

There is another safe datalog program that produces the answer to Q and takes no more time when evaluated by semi-naive evaluation than when P.P.1.subscrpt is evaluated topdown.

Towards a Theory of Declarative Knowledge