Due to the usual incompleteness of information representation, any approach to assign a semantics to logic programs has to rely on a default assumption on the missing information. The stable model semantics, that has become the dominating approach to give semantics to logic programs, relies on the Closed World Assumption (CWA), which asserts that by default the truth of an atom is false. There is a second well-known assumption, called Open World Assumption (OWA), which asserts that the truth of the atoms is supposed to be unknown by default. However, the CWA, the OWA and the combination of them are extremal, though important, assumptions over a large variety of possible assumptions on the truth of the atoms, whenever the truth is taken from...
Structuring logic programs to deal with evolving and incomplete knowledge is one of the main issues ...
Abstract. The Closed-World Assumption (CWA) on a database ex-presses that an atom not in the databas...
International audienceWe analyse alternative extensions of stable models for non-disjunctive logic p...
AbstractDue to the usual incompleteness of information representation, any approach to assign a sema...
Recently, in (Loyer & Straccia 2005) the Any-World Assumption (AWA) has been introduced for norm...
Abstract. Many frameworks have been proposed to manage uncertain informa-tion in logic programming. ...
AbstractGiven a program P we specify an enlargement of its well-founded model which gives meaning to...
Given a program P we specify an enlargement of its well-founded model which gives meaning to the add...
AbstractThe treatment of negation and negative information in a logic programming environment has tu...
Abstract. Different many-valued logic programming frameworks have been proposed to manage uncertain ...
Abstract. Different many-valued logic programming frameworks have been proposed to manage uncertain ...
AbstractThe stable model semantics for logic programs is extended from ground literals onto open lit...
One of the most used assumptions in logic programming and deductive databases is the so-called Close...
The Closed-World Assumption (CWA) on a database expresses that an atom not in the database is false....
The introduction of negation in rule bodies of logic programs may lead to semantic ambiguities: Norm...
Structuring logic programs to deal with evolving and incomplete knowledge is one of the main issues ...
Abstract. The Closed-World Assumption (CWA) on a database ex-presses that an atom not in the databas...
International audienceWe analyse alternative extensions of stable models for non-disjunctive logic p...
AbstractDue to the usual incompleteness of information representation, any approach to assign a sema...
Recently, in (Loyer & Straccia 2005) the Any-World Assumption (AWA) has been introduced for norm...
Abstract. Many frameworks have been proposed to manage uncertain informa-tion in logic programming. ...
AbstractGiven a program P we specify an enlargement of its well-founded model which gives meaning to...
Given a program P we specify an enlargement of its well-founded model which gives meaning to the add...
AbstractThe treatment of negation and negative information in a logic programming environment has tu...
Abstract. Different many-valued logic programming frameworks have been proposed to manage uncertain ...
Abstract. Different many-valued logic programming frameworks have been proposed to manage uncertain ...
AbstractThe stable model semantics for logic programs is extended from ground literals onto open lit...
One of the most used assumptions in logic programming and deductive databases is the so-called Close...
The Closed-World Assumption (CWA) on a database expresses that an atom not in the database is false....
The introduction of negation in rule bodies of logic programs may lead to semantic ambiguities: Norm...
Structuring logic programs to deal with evolving and incomplete knowledge is one of the main issues ...
Abstract. The Closed-World Assumption (CWA) on a database ex-presses that an atom not in the databas...
International audienceWe analyse alternative extensions of stable models for non-disjunctive logic p...