Prolegomena to Logic Programming for Non-monotonic Reasoning

@inproceedings{Dix1996ProlegomenaTL,
  title={Prolegomena to Logic Programming for Non-monotonic Reasoning},
  author={J{\"u}rgen Dix and Lu{\'i}s Moniz Pereira and Teodor C. Przymusinski},
  booktitle={NMELP},
  year={1996}
}
The present prolegomena consist, as all indeed do, in a critical discussion serving to introduce and interpret the extended works that follow in this book. As a result, the book is not a mere collection of excellent papers in their own specialty, but provides also the basics of the motivation, background history, important themes, bridges to other areas, and a common technical platform of the principal formalisms and approaches, augmented with examples. 
View via Publisher
50 Citations
Background Citations
4
Methods Citations
4

50 Citations

Citation Type

Citation Type

DisLoP: A Research Project on Disjunctive Logic Programming
This paper gives a brief highdlevel description of what has been done in the Disjunctive Logic Programmingdproject (funded by Deutsche ForschungsdGemeinschaft), undertaken by the University of…
Hyper Tableaux The Next Generation
TLDR
An improvement is introduced which removes the major weakness of the calculus, which is the need to (at least partially) blindly guess ground-instantiations for certain clauses, now replaced by a unification-driven technique.
A Framework to Incorporate Non-Monotonic Reasoning Into Constraint Logic Programming
Con uent Rewriting Systems forLogic Programming
TLDR
It is shown that most of the well-known semantics for normal logic programs are induced by connuent LP-systems, and several new transformation rules are introduced that induce interesting semantics which are polynomial time computable, extend WFS and seem suitable for modelling aggregation in logic programs.
Loop-Detection in Hyper-Tableaux by Powerful Model Generation
TLDR
This work combines approaches from tableau-based theorem proving, model generation, andComputer algebra systems in the theorem proving process by extending the hyper-tableau calculus by generalized terms with exponents, that can be computed by means of computer algebra systems.
Super Logic Programs Super Logic Programs 1
TLDR
The class of super logic programs is proposed, which is suuciently exible to allow various application-dependent extensions and modiications and should be closely related to other well-established non-monotonic formalisms.
The Logic Programming Paradigm
  • J. Dix
  • Computer Science
    AI Commun.
  • 1998
TLDR
Past and current activities in Logic Programming were described and the future of the field was critically discussed at an international meeting in Shakertown.
Merge Path Improvements for Minimal Model Hyper Tableaux
TLDR
This paper develops as the main contribution a sound and complete calculus for propositional circumscriptive reasoning in the presence of minimized and varying predicates for refutational first-order theorem proving within the clause tree framework.
Learning Three-Valued Logic Programs
TLDR
It is shown that the adoption of a three-valued setting for inductive concept learning is particularly useful for learning, and the issue of combination of possibly contradictory learnt de nitions is handled, and strategies for theory are shown.
Model-Guided Proof Debugging
TLDR
This paper introduces techniques which are also applic able in the case of nontermination in automated deduction, and uses a natural interface for inspecting even intermediate results of the proof search, and employs tableau-based calculi, especially hyper-tableaux, for debugging axiomatizations.
...
...

References

SHOWING 1-10 OF 213 REFERENCES
Compiling Circumscriptive Theories into Logic Programs
TLDR
The description of a given circumscriptive theory T can be sometimes transformed into a logic program II, so that, by running II, it can be determined whether a given ground literal is provable in T.
Calculi for Disjunctive Logic Programming
TLDR
This paper uses restart model elimination (RME) and shows as the main result that hyper tableaux provide a bottom-up semantics for the top-down calculus, and generalizes the well-known result linking the T -operator to SLDresolution for definite programs towards disjunctive programs.
Problems and Promises of Computational Logic
TLDR
It is argued that two major extensions of logic programming are needed — abduction and metalevel reasoning and extensions of full first-order logic may not be necessary.
An Overview of Nonmonotonic Reasoning and Logic Programming
  • J. Minker
  • Computer Science
    J. Log. Program.
  • 1993
Towards a Theory of Declarative Knowledge
Non-monotonic Extensions of Logic Programming: Theory, Implementation and Applications
TLDR
This workshop is the fth in a series of workshops held in conjunction with Logic Programming conferences and will be concerned with all of the three aspects of Theory, Implementation, and Applications, devoted to semantics, applications and computation.
Characterizing D-WFS: Confluence and Iterated GCWA
TLDR
Quite recently Brass/Dix have introduced the semantics D-WFS for general disjunctive logic programs, which is both semantically and proof-theoretically founded.
Logic programming as constructivism: a formalization and its application to databases
TLDR
This work motivates and proposes a constructivistic proof theory of non-Horn logic programming, and shows that 'stratification' can be motivated in a simple and intuitive way, and introduces the larger classes of 'loosely stratified' and constructively consistent programs.
Negation in Logic Programming
  • K. Kunen
  • Computer Science
    J. Log. Program.
  • 1987
Embedding Negation as Failure into a Model Generation Theorem Prover
TLDR
An implementation which computes answer sets of every class of (function-free) logic programs and deductive databases containing both negation as failure and classical negation is given.
...
...