# Partial Models of Extended Generalized Logic Programs

@inproceedings{Alferes2000PartialMO, title={Partial Models of Extended Generalized Logic Programs}, author={Jos{\'e} J{\'u}lio Alferes and Heinrich Herre and Lu{\'i}s Moniz Pereira}, booktitle={Computational Logic}, year={2000} }

In recent years there has been an increasing interest in extensions of the logic programming paradigm beyond the class of normal logic programs motivated by the need for a satisfactory respresentation and processing of knowledge. An important problem in this area is to find an adequate declarative semantics for logic programs. In the present paper a general preference criterion is proposed that selects the 'intended' partial models of extended generalized logic programs which is a conservative…

## 7 Citations

Stationary Generated Models of Generalized Logic Programs

- Computer Science
- 2009

A general preference criterion is proposed that selects the ‘intended’ partial models of generalized logic programs which is a conservative extension of the stationary semantics for normal logic programs of [Prz91].

Stable Generated Models of Generalized Constraint Logic Programs

- Computer Science
- 2001

This work deene stable generated models of generalized constraint logic programs and describes some of their properties to provide a declarative semantics of this program class that extends naturally the least C{model semantics for deenite programs with constraints deened by Jaaar et al.

Paraconsistent Declarative Semantics for Extended Logic Programs

- Computer ScienceAnnals of Mathematics and Artificial Intelligence
- 2004

A fixpoint semantics for logic programs with two kinds of negation: an explicit negation and a negation-by-failure is introduced and it is shown that this formalism may be regarded as a simple and flexible process for belief revision.

Contributions to the Ontological Foundationof Knowledge

- Philosophy, Computer Science
- 2001

The principles underlying knowledge acquisition from an axiomatic-deductive point of view are discussed and a knowledge modelling language called GOL, for (General Ontological Language), is outlined, and it is compared to other languages of this sort.

Contributions to the Ontological Foundation of Knowledge Modelling

- Philosophy, Computer Science
- 2001

The principles underlying knowledge acquisition from an axiomaticdeductive point of view are discussed and a knowledge modelling language called GOL, for (General Ontological Language), is outlined, and it is compared to other languages of this sort.

Evolutivo de inteligencia em la optimización de funciones

- Philosophy
- 2011

Esta tese de doutoramento aborda diferentes areas de investigacao, nomeadamente os paradigmas, simbolico, conexionista e evolutivo. A combinacao de tecnicas da Inteligencia Artificial, como o…

## References

SHOWING 1-10 OF 33 REFERENCES

Semantical Foundation of Extended Generalized Logic Programs

- Computer Science
- 1997

A deenition of stable generated models for extended generalized logic programs (EGLP) is presented which is sound with respect to the answer set semantics for extended disjunctive programs of GL91 and does not refer to negation-as-failure.

Generated models and extensions of nonmonotonic systems

- Computer ScienceICLP 1997
- 1997

It is shown that stable generated semantics coincide with the semantics obtained by translating programs into a minimal partial temporal logic into which a subsystem of default logic can be embedded, which leads to a new version of disjunctive default logic, based on generated extensions.

Stable Generated Models, Partial Temporal Logic and Disjunctive Defaults

- Computer Science, PhilosophyJ. Log. Program.
- 1999

Super Logic Programs and Negation as Belief

- Computer Science, PhilosophyELP
- 1996

The proposed semantics of such programs is sufficiently powerful to precisely determine answers to the above queries and the answers, when restricted to normal logic programs, coincide with those provided by one of the wellestablished semantics ofnormal logic programs.

Partial logics with two kinds of negation as a foundation for knowledge-based reasoning

- Computer Science, Philosophy
- 1995

The notions of minimal, paraminimal and stable models are presented in terms of partial logic and it is shown how the resulting definitions can be used to define the semantics of knowledge bases such as relational and deductive databases, and extended logic programs.

Reasoning with Logic Programming

- Computer ScienceLecture Notes in Computer Science
- 1996

WFSX is a new semantics for extended logic programs that combines LP semantics with two negations, and autoepistemic logics to deal with contradiction.

Characterizing D-WFS: Confluence and Iterated GCWA

- Computer ScienceJELIA
- 1996

Quite recently Brass/Dix have introduced the semantics D-WFS for general disjunctive logic programs, which is both semantically and proof-theoretically founded.