Results 11  20
of
259
Reasoning With Minimal Belief and Negation as Failure: Algorithms and Complexity
 In Proc. of AAAI97, 430435
, 1997
"... 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, including default logic, autoepistemic logic, circumscriptio ..."
Abstract

Cited by 14 (12 self)
 Add to MetaCart
, circumscription, epistemic queries and logic programming. We characterize the complexity and provide algorithms for reasoning in propositional MBNF . In particular, we show that skeptical entailment in propositional MBNF is \Pi p 3 complete, hence, it is harder than reasoning in all the above mentioned
Reasoning about Minimal Belief and Negation as Failure
 J. of Artificial Intelligence Research
, 1999
"... We investigate the problem of reasoning in 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, including default logic, autoepistemic logic, circumscri ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
, circumscription, epistemic queries, and logic programming. We characterize the complexity and provide algorithms for reasoning in propositional MBNF. In particular, we show that skeptical entailment in propositional MBNF is \Pi p 3 complete, hence it is harder than reasoning in all the above mentioned
Experimenting with power default reasoning
 In Proceedings of the AAAI National Conference on Arti Intelligence
, 1998
"... In this paper we explore the computational aspects of Propositional Power Default Reasoning (PDR), a form of nonmonotonic reasoning which the underlying logic is Kleene’s 3valued propositional logic. PDR leads to a concise meaning of the problem of skeptical entailment which has better complexity ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this paper we explore the computational aspects of Propositional Power Default Reasoning (PDR), a form of nonmonotonic reasoning which the underlying logic is Kleene’s 3valued propositional logic. PDR leads to a concise meaning of the problem of skeptical entailment which has better complexity
A General Modal Framework for the Event Calculus and its Skeptical and Credulous Variants
, 1996
"... We propose a general and uniform modal framework for the Event Calculus (EC) and its skeptical Appeared as Reasearch Report 37/96RR, Dipartimento di Matematica e Informatica, Universit`a di Udine, Italy, July 1996. and credulous variants. The resulting temporal formalism, called the Generalized Mo ..."
Abstract

Cited by 14 (9 self)
 Add to MetaCart
by allowing free mixing of propositional connectives and modal operators. We first give a semantic definition of GMEC; then, we propose a declarative encoding of GMEC in the language of hereditary Harrop formulae and prove the soundness and completeness of the resulting logic programs 1 . Keywords
An Encompassing Framework for Paraconsistent Logic Programs
 J. Applied Logic
, 2003
"... We propose a framework which extends Antitonic Logic Programs [13] to an arbitrary complete bilattice of truthvalues, where belief and doubt are explicitly represented. Inspired by Ginsberg and Fitting 's bilattice approaches, this framework allows a precise de nition of important operato ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
We propose a framework which extends Antitonic Logic Programs [13] to an arbitrary complete bilattice of truthvalues, where belief and doubt are explicitly represented. Inspired by Ginsberg and Fitting 's bilattice approaches, this framework allows a precise de nition of important
PSHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web
, 2002
"... Ontologies play a central role in the development of the semantic web, as they provide precise definitions of shared terms in web resources. One important web ontology language is DAML+OIL; it has a formal semantics and a reasoning support through a mapping to the expressive description logic SHOQ ..."
Abstract

Cited by 90 (13 self)
 Add to MetaCart
probabilistic default reasoning. It allows to express rich probabilistic knowledge about concepts and instances, as well as default knowledge about concepts. We also present sound and complete reasoning techniques for PSHOQ(D), which are based on reductions to classical reasoning in SHOQ(D) and to linear
On Eliminating Disjunctions in Stable Logic Programming
 PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING (KR 2004
, 2003
"... Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge representation and reasoning. However, disjunction is often not really needed, in that an equivalent program without disju ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
disjunction can be given. In this paper, we consider the question, given a disjunctive logic program, P , under which conditions does there exist an equivalent normal (i.e., disjunctionfree) logic program P . In fact, we study this problem under different notions of equivalence, viz. for ordinary
ALC + T: Reasoning About Typicality in Description Logics
"... Abstract. We extend the Description Logic ALC with a “typicality” operator T that allows us to reason about the prototypical properties and inheritance with exceptions. The resulting logic is called ALC + T. The typicality operator is intended to select the “most normal ” or “most typical ” instance ..."
Abstract
 Add to MetaCart
Abstract. We extend the Description Logic ALC with a “typicality” operator T that allows us to reason about the prototypical properties and inheritance with exceptions. The resulting logic is called ALC + T. The typicality operator is intended to select the “most normal ” or “most typical
Articles Talking Past Each Other? Cultural Framing of Skeptical and Convinced Logics in the Climate Change Debate
"... Abstract This article analyzes the extent to which two institutional logics around climate changethe climate change "convinced" and the climate change "skeptical" logicsare truly competing or talking past each other in a way that can be described as a logic schism. Drawing on ..."
Abstract
 Add to MetaCart
is risk (chisquare p ≤ .001). Religion (chisquare p ≤ .001) and national security (chisquare p ≤ .001) are latent or dormant. Results for economics and technology were not significant. Not surprisingly, almost 90% of skeptical articles reference science. It suggests that the skeptical logic centers
Answering Queries from ContextSensitive Probabilistic Knowledge Bases
 Theoretical Computer Science
, 1996
"... We define a language for representing contextsensitive probabilistic knowledge. A knowledge base consists of a set of universally quantified probability sentences that include context constraints, which allow inference to be focused on only the relevant portions of the probabilistic knowledge. We p ..."
Abstract

Cited by 98 (0 self)
 Add to MetaCart
the declarative semantics to prove the query procedure sound and complete. We use concepts from logic programming to justify our approach. Keywords: reasoning under uncertainty, Bayesian networks, Probability model construction, logic programming Submitted to Theoretical Computer Science special issue
Results 11  20
of
259