Results 11  20
of
8,140
Nonmonotonic Reasoning
 In Proc
, 1993
"... Classical logic is the study of ”safe ” formal reasoning. Western Philosophers developed classical logic over a period of thirtythree centuries after its introduction in the form of syllogistic by Aristotle [1] in the third century B. C. Beginning in the nineteenth century with De Morgan [2] and B ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Classical logic is the study of ”safe ” formal reasoning. Western Philosophers developed classical logic over a period of thirtythree centuries after its introduction in the form of syllogistic by Aristotle [1] in the third century B. C. Beginning in the nineteenth century with De Morgan [2] and Boole [3], responsibility for the development of classical logic moved from the philosophical to the mathematical community.
Nonmonotonic Learning
 Inductive Logic Programming
, 1992
"... This paper addresses methods of specialising firstorder theories within the context of incremental learning systems. We demonstrate the shortcomings of existing firstorder incremental learning systems with regard to their specialisation mechanisms. We prove that these shortcomings are fundamental ..."
Abstract

Cited by 60 (12 self)
 Add to MetaCart
to the use of classical logic. In particular, minimal "correcting " specialisations are not always obtainable within this framework. We propose instead the adoption of a specialisation scheme based on an existing nonmonotonic logic formalism. This approach overcomes the problems that arise
What Could a Natural Deductive System for Nonmonotonic Reasoning Look Like?
 First Workshop on Principles and Practice of Constraint Programming, Rhode Island
, 1993
"... This paper is concerned with the problem of how to construct a natural deductive system for nonmonotonic reasoning. Three possible constructions are investigated, the ones which consists of (1) pure nonmonotonic inference rules; (2) nonmonotonic inference rules plus a nonmonotonic tautology base ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper is concerned with the problem of how to construct a natural deductive system for nonmonotonic reasoning. Three possible constructions are investigated, the ones which consists of (1) pure nonmonotonic inference rules; (2) nonmonotonic inference rules plus a nonmonotonic tautology
Nonmonotonic Logics and Semantics
 Journal of Logic and Computation
, 2001
"... Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas i a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may be deduced from a set A of formulas i a holds in all of th ..."
Abstract

Cited by 30 (4 self)
 Add to MetaCart
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas i a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may be deduced from a set A of formulas i a holds in all
Nonmonotonic Reasoning In LDL++
 LogicBased Artificial Intelligence
, 2000
"... Deductive database systems have made major advances on efficient support for nonmonotonic reasoning. A first generation of deductive database systems supported the notion of stratification for programs with negation and set aggregates. Stratification is simple to understand and efficient to impl ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Deductive database systems have made major advances on efficient support for nonmonotonic reasoning. A first generation of deductive database systems supported the notion of stratification for programs with negation and set aggregates. Stratification is simple to understand and efficient
Nonmonotonic Reasoning in Florid
 In Proc. Intl. Conference on Logic Programming and Nonmonotonic Reasoning, number 1265 in LNAI
, 1997
"... The advantages of Florid as a deductive objectoriented database system are the rich objectoriented modeling facilities of its language Flogic. The focus of this paper is on Florid's multiple inheritance mechanism which turns out to be a useful means to adapt various examples of nonmonotonic ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
of nonmonotonic reasoning in the objectoriented setting. 1 Introduction With Florid (Flogic reasoning in databases) [7] we present an implementation of all essential features of Flogic, a rule language for deductive objectoriented databases. In this area one is concerned with nonmonotonic reasoning
Consistency Verification of a Nonmonotonic Deductive System based on OWL Lite
"... Abstract. The aim of this paper is to show a method that is able to detect a particular class of semantic inconsistencies in a deductive system (DS). A DS verified by this method contains a set of production rules, and an OWL Lite ontology that defines the problem domain. The antecedent of a rule is ..."
Abstract
 Add to MetaCart
Abstract. The aim of this paper is to show a method that is able to detect a particular class of semantic inconsistencies in a deductive system (DS). A DS verified by this method contains a set of production rules, and an OWL Lite ontology that defines the problem domain. The antecedent of a rule
Generalized Query Answering in Disjunctive Deductive Databases: Procedural and Nonmonotonic Aspects
 Proc. LPNMR'97. Springer, LNAI 1265
, 1997
"... . Generalized queries are defined as sets of clauses in implication form. They cover several tasks of practical importance for database maintenance such as answering positive queries, computing database completions and integrity constraints checking. We address the issue of answering generalized ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
generalized queries under the minimal model semantics for the class of Disjunctive Deductive Databases (DDDBs). Our approach is based on having the query induce an order on the models returned by a sound and complete minimal model generating procedure. We consider answers that are true in all and those
Nonmonotonic Abductive Inductive Learning
 Journal of Applied Logic
, 2008
"... Inductive Logic Programming (ILP) is concerned with the task of generalising sets of positive and negative examples with respect to background knowledge expressed as logic programs. Negation as Failure (NAF) is a key feature of logic programming which provides a means for nonmonotonic commonsense re ..."
Abstract

Cited by 30 (6 self)
 Add to MetaCart
Inductive Logic Programming (ILP) is concerned with the task of generalising sets of positive and negative examples with respect to background knowledge expressed as logic programs. Negation as Failure (NAF) is a key feature of logic programming which provides a means for nonmonotonic commonsense
Results 11  20
of
8,140