Results 1  10
of
526
Order and Negation as Failure
 In Procs. of the Intl. Conference on Logic Programming, volume 2916 of LNCS
, 2003
"... We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs.
Classical negation in logic programs and disjunctive databases
 New Generation Computing
, 1991
"... An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic progra ..."
Abstract

Cited by 1044 (73 self)
 Add to MetaCart
programs by including classical negation, in addition to negationasfailure. The semantics of such extended programs is based on the method of stable models. The concept of a disjunctive database can be extended in a similar way. We show that some facts of commonsense knowledge can be represented by logic
Splitting a Logic Program
 Principles of Knowledge Representation
, 1994
"... In many cases, a logic program can be divided into two parts, so that one of them, the \bottom " part, does not refer to the predicates de ned in the \top " part. The \bottom " rules can be used then for the evaluation of the predicates that they de ne, and the computed va ..."
Abstract

Cited by 294 (16 self)
 Add to MetaCart
by the theorem may use both negation as failure and classical negation, and their rules may have disjunctive heads. The usefulness of the concept of splitting for the investigation of answer sets is illustrated by several applications. First, we show that a conservative extension theorem by Gelfond
Randomized rumor spreading
 In IEEE Symposium on Foundations of Computer Science
, 2000
"... We investigate the class of socalled epidemic algorithms that are commonly used for the lazy transmission of updates to distributed copies of a database. These algorithms use a simple randomized communication mechanism to ensure robustness. Suppose players communicate in parallel rounds in each of ..."
Abstract

Cited by 287 (2 self)
 Add to MetaCart
prove the robustness of this algorithm, e.g., against adversarial failures. On the negative side, we show that any addressoblivious algorithm (i.e., an algorithm that does not use the addresses of communication partners) needs to send messages for each rumor regardless of the number of rounds
On the Complexity of Reasoning With Negation as Failure
 In Proc. Workshop on deductive databases and logic programming (DDLP96
, 1996
"... In this work we study the computational properties of the propositional fragment of MBNF , the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms. In particular, the logic MBNF has been used in ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this work we study the computational properties of the propositional fragment of MBNF , the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms. In particular, the logic MBNF has been used
Negating An Ordering Relation
, 1995
"... This paper is concerned primarily with the interaction between until and overt negation. In the literature, one trend of analysis classifies until as a special negative polarity item (NPI) which, contrary to all other temporal expressions considered sensitive to polarity, is subject to further aspec ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper is concerned primarily with the interaction between until and overt negation. In the literature, one trend of analysis classifies until as a special negative polarity item (NPI) which, contrary to all other temporal expressions considered sensitive to polarity, is subject to further
Minimal belief and negation as failure: A feasible approach
 In Proc. of the 11th Nat. Conf. on Artificial Intelligence (AAAI'93
, 1993
"... Lifschitz introduced a logic of minimal belief and negation as failure, called mbnf, in order to provide a theory of epistemic queries to nonmonotonic databases. We present a feasible subsystem of mbnf which can be translated into a logic built on first order logic and negation as failure, called fo ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Lifschitz introduced a logic of minimal belief and negation as failure, called mbnf, in order to provide a theory of epistemic queries to nonmonotonic databases. We present a feasible subsystem of mbnf which can be translated into a logic built on first order logic and negation as failure, called
Firstorder theories for pure Prolog programs with negation
 Archive for Mathematical Logic
, 1995
"... The standard theory of logic programming is not applicable to Prolog programs even not to pure code. Modifying the theory to take account of reality more is the motivation of this article. For this purpose we introduce the #completion and the inductive extension of a logic program. Both are firsto ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
The standard theory of logic programming is not applicable to Prolog programs even not to pure code. Modifying the theory to take account of reality more is the motivation of this article. For this purpose we introduce the #completion and the inductive extension of a logic program. Both are firstorder
Minimal Belief and Negation as Failure in MultiAgent Systems
 Annals of Mathematics and Artificial Intelligence
"... We propose an epistemic, nonmonotonic approach to the formalization of knowledge in a multiagent setting. From the technical viewpoint, a family of nonmonotonic logics, based on Lifschitz’s modal logic of minimal belief and negation as failure, is proposed, which allows for formalizing an agent whi ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We propose an epistemic, nonmonotonic approach to the formalization of knowledge in a multiagent setting. From the technical viewpoint, a family of nonmonotonic logics, based on Lifschitz’s modal logic of minimal belief and negation as failure, is proposed, which allows for formalizing an agent
Embedded Implications as a Generalization of Negation as Failure
"... . We introduce the new class of logic programs with a nonmonotonic operator, namely, the programs with universally quantified embedded implications. The main reason for this is expressiveness of programs. The main subject of the paper is generalization of notions and theorems, related to the declar ..."
Abstract
 Add to MetaCart
with negation as failure. 1 Introduction The firstorder logic is a powerful and popular formalism. Howeve...
Results 1  10
of
526