Towards a Theory of Declarative Knowledge

@inproceedings{Apt1988TowardsAT,
  title={Towards a Theory of Declarative Knowledge},
  author={Krzysztof R. Apt and Howard A. Blair and Adrian Walker},
  booktitle={Foundations of Deductive Databases and Logic Programming.},
  year={1988}
}

On the Declarative Semantics of Logic Programs with Negation

  • V. Lifschitz
  • Computer Science
    Foundations of Deductive Databases and Logic Programming.
  • 1988

Fully Declarative Logic Programming

A theoretical basis for implementation of a fully declarative logic programming language which allows use of quantifiers and negation in the statement bodies is presented and SLPG — a resolution system extending SLD-resolution, but alternative to SLDNF is formulated.

A Natural Semantics for Logic Programs with Negation

The fixpoint theory of Van Emden and Kowalski and Clark's predicate completion does not apply to general programs with negation; a generalization of the theory can be defined only if the programs are stratified.

Guarded resolution for Answer Set Programming

A proof system based on a guarded resolution rule is investigated and its adequacy for the stable semantics of normal logic programs is shown and it is shown that Gelfond–Lifschitz operator can be viewed as a proof-theoretic concept.

Elimination of Negation in a Logical Framework

This work adapts the idea of elimination of negation introduced in [17] for Horn logic to a fragment of higher-order HHF to isolate a set of programs where static and dynamic clauses do not overlap.

On the Declarative Semantics of Deductive Databases and Logic Programs

On the Semantics of Logic Programs

The paper is a general overview of our approach to the semantics of logic programs whose aim is finding notions of models which really capture the operational semantics, and are therefore useful for

Combining Explicit Negation and Negation by Failure Via Belnap's Logic

Well-founded semantics and stratification for ordered logic programs

An extension of traditional logic programming, called ordered logic (OL) programming, is presented to support classical negation as well as constructs from the object-oriented paradigm to cope with the notions of object, multiple inheritance and non-monotonic reasoning.
...

References

SHOWING 1-10 OF 38 REFERENCES

On the Declarative Semantics of Logic Programs with Negation

  • V. Lifschitz
  • Computer Science
    Foundations of Deductive Databases and Logic Programming.
  • 1988

Horn Clauses Queries and Generalizations

A Functional Approach to Non-Monotonic Logic

For non-monotonic rules in general (not only normal default rules) this work defines a stronger version of the minimality requirement on consistent fixpoints, and proves that it is sufficient for the existence of a derivation of the fixpoint.

Signed Data Dependencies in Logic Programs

  • K. Kunen
  • Computer Science
    J. Log. Program.
  • 1989

A functional approach to non‐monotonic logic 1

A stronger concept, approachable fixpoints, is introduced and proven to be sufficient for the existence of a derivation of the fixpoint, and the usefulness of the approach is demonstrated by concise proofs for some previously known results about normal default rules.

Negation as Failure Using Tight Derivations for General Logic Programs

  • A. V. Gelder
  • Computer Science
    Foundations of Deductive Databases and Logic Programming.
  • 1988

Negation as Failure II

Negation in Logic Programming

  • J. Shepherdson
  • Computer Science
    Foundations of Deductive Databases and Logic Programming.
  • 1988

Contributions to the Theory of Logic Programming

It is shown that nondeterministic flowchart schemata of bounded nondeterminacy are modeled by this special case of Hom clauses, and the connection between finite failure and greatest fixpoint is used to give a semantic characterization of termination, blocking, and nontermination of such flowchart Schemata.

Maintenance of stratified databases viewed as a belief revision system

We study here declarative and dynamic aspects of non-monotonic reasoning in the context of deductive databases. More precisely, we consider here maintenance of a special class of indefinite deductive