Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(3)
Deductive Databases
Logic Programs
nonmonotonic reasoning
Related Publications
(11)
Paraconsistent Declarative Semantics for Extended Logic Programs
Well Founded Semantics for Logic Programs with Explicit Negation
Extended Logic Programs with Default Assumptions
Representing Actions in Extended Logic Programming
An Argumentation Semantics for Logic Programming with Explicit Negation
Subscribe
Academic
Publications
On Logic Program Semantics with Two Kinds of Negation
On Logic Program Semantics with Two Kinds of Negation,José Júlio Alferes,Luís Moniz Pereira
Edit
On Logic Program Semantics with Two Kinds of Negation
(
Citations: 54
)
BibTex

RIS

RefWorks
Download
José Júlio Alferes
,
Luís Moniz Pereira
Recently several authors have stressed and showed the importance of havinga second kind of negation in
logic programs
for use in deductive databases,knowledge representation, and
nonmonotonic reasoning
[6, 7, 8, 9, 13, 14,15, 24].Different semantics for
logic programs
extended with :negation (extendedlogic programs) have appeared [1, 4, 6, 9, 11, 12, 17, 19, 24] but,contrary to what happens with semantics for normal logic programs, thereis no general comparison among them, specially in ...
Conference:
International Conference on Logic Programming/Joint International Conference and Symposium on Logic Programming  ICLP(JICSLP)
, pp. 574588, 1992
Cumulative
Annual
Citation Context
(17)
...(
Alferes & Pereira 1992;
Arieli 2002; Gelfond & Lifschitz 1991)); (ii) it covers manyvalued logic programming with nonmonotone negation (e.g...
Umberto Straccia
.
Query Answering under the AnyWorld Assumption for Normal Logic Progra...
...In view of these facts, Alferes and Pereira [
25
,14] presented a new version of the well founded model semantics, called WFSX, such that the coherence principle (see section 2) is enforced...
Pablo R. Fillottrani
,
et al.
Representing Defaults and Negative Information Without NegationasFai...
...[
2
]), are extremal, though important, assumptions over a large variety of possible assumptions on the truth of the atoms, whenever the truth is taken from an arbitrary truth space...
...[
2
,3,21]). In ELP one can distinguish between...
...For instance, we may state a closed world assumption on an atom A by means of H(A) = f and, thus,¬A may behave like not(A), while state an open world assumption on an atom A, simulating explicit negation, by means of H(A) = ?. Also, by using the method described in [21] (and used in [
2
] as well) to remove expressions of the form¬A in ELPs, we may “translated” an ELP into our framework...
...However, in this paper we are not going to investigate further the relationship between ELPs (with their various semantics [
2
,3,21]) and our framework, but rather want to show how to use the feature of the any world assumption in some of the application scenarios considered for ELPs...
...10 We may also additionally relate ¯ A to A with some axioms, as in [
2
]...
...A ¬A} (this is called the strong negation axiom in [
2
]), or add {A ¬ ¯ A} (this is called the weak negation axiom or add{(A ¬ ¯ A), ( ¯...
...Our work generalizes related work such as [
2
,26,31,32,36]...
...In [
2
,26] some atoms are allowed to be interpreted according to the OWA, while others are allowed to be interpreted according to the CWA and, thus, roughly the choice of the default is restricted to the value unknown and/or false (additionally, [26] allows to manage default rules as well)...
Yann Loyer
,
et al.
AnyWorld Assumptions in Logic Programming
...Consistency is a basic property for agent’s beliefs, in the sense that it is not possible to believe simultaneously in a literal Q and its complement Q [
30
]...
Marcela Capobianco
,
et al.
Argumentation and the Dynamics of Warranted Beliefs in Changing Enviro...
...Consistency is a basic property for agent’s beliefs, in the sense that it is not possible to believe simultaneously in a literal Q and its complement Q [
16
]...
Marcela Capobianco
,
et al.
An ArgumentBased Framework to Model an Agent's Beliefs in a Dynamic E...
References
(19)
Extended WellFounded Semantics for Paraconsistent Logic Programs
(
Citations: 17
)
Chiaki Sakama
Conference:
Fifth Generation Computer Systems  FGCS
, pp. 592599, 1992
Contradiction Removal Semantics with Explicit Negation
(
Citations: 17
)
Luís Moniz Pereira
,
José Júlio Alferes
,
Joaquim Nunes Aparício
Conference:
Logic at Work
, pp. 91105, 1992
Contradiction Removal within Well Founded Semantics
(
Citations: 59
)
Luís Moniz Pereira
,
José Júlio Alferes
,
Joaquim Nunes Aparício
Conference:
Logic Programming and Nonmonotonic Reasoning  LPNMR
, pp. 105119, 1991
Nonmonotonic Reasoning with Well Founded Semantics
(
Citations: 35
)
Luís Moniz Pereira
,
Joaquim Nunes Aparício
,
José Júlio Alferes
Conference:
International Conference on Logic Programming/Joint International Conference and Symposium on Logic Programming  ICLP(JICSLP)
, pp. 475489, 1991
Semantic Issues in Deductive Databases and Logic Programs
(
Citations: 82
)
Halina Przymusinska
,
Teodor Przymusinski
Published in 1990.
Sort by:
Citations
(54)
MWeb: A principled framework for modular web rule bases and its semantics
(
Citations: 3
)
Anastasia Analyti
,
Grigoris Antoniou
,
Carlos Viegas Damasio
Journal:
ACM Transactions on Computational Logic  TOCL
, vol. 12, no. 2, pp. 146, 2011
International Center for Computational Logic
TU Dresden
Published in 2009.
A Logic Description on Different Negation Relation in Knowledge
(
Citations: 5
)
Zhenghua Pan
Conference:
International Conference on Intelligent Computing  ICIC
, pp. 815823, 2008
A TopDown Query Answering Procedure for Normal Logic Programs under the AnyWorld Assumption
(
Citations: 5
)
Umberto Straccia
Published in 2007.
Query Answering under the AnyWorld Assumption for Normal Logic Programs
(
Citations: 9
)
Umberto Straccia
Conference:
Principles of Knowledge Representation and Reasoning  KR
, pp. 329339, 2006