A Logic for Approximate First-Order Reasoning

@inproceedings{Koriche2001ALF,
  title={A Logic for Approximate First-Order Reasoning},
  author={Fr{\'e}d{\'e}ric Koriche},
  booktitle={CSL},
  year={2001}
}
  • F. Koriche
  • Published in CSL 10 September 2001
  • Computer Science
In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the first-order case is only semi-decidable. Even in the restricted case of finite universes of discourse, reasoning remains inherently intractable, as the reasoner has to deal with two independent sources of complexity: unbounded chaining and unbounded quantification. The purpose of this study is to handle these difficulties in a… 
3 Citations
Approximate coherence-based reasoning
  • F. Koriche
  • Computer Science, Philosophy
    J. Appl. Non Class. Logics
  • 2002
It has long been recognized that the concept of inconsistency is a central part of commonsense reasoning. In this issue, a number of authors have explored the idea of reasoning with maximal
On Anytime Coherence-Based Reasoning
TLDR
A logical framework is defined which is semantically founded on the notion of resource which captures both the accuracy and the computational cost of anytime operations and shows that an anytime view of coherence-based reasoning is tenable.
Approximate assertional reasoning over expressive ontologies
TLDR
An approximate ontology reasoning framework has been devised, which enables scalable assertional reasoning over expressive ontologies by loosely integrating the approximate reasoning solutions developed in this work.

References

SHOWING 1-10 OF 34 REFERENCES
Limited Reasoning in First-Order Knowledge Bases
Efficient first-order semantic deduction techniques
TLDR
Theorem prover OSHL represents a novel combination of efficient propositional decision procedures, semantic guidance and term rewriting, and it is shown that OSHL is both experimentally and asymptotically efficient.
Tractable Reasoning via Approximation
A Logic for Anytime Deduction and Anytime Compilation
TLDR
A logic is defined which handles anytime deduction and anytime compilation by incorporating several major features and is semantically founded on the notion of resource which captures both the accuracy and the cost of approximation.
Approximate Reasoning about Combined Knowledge
TLDR
A model checking approach is advocated, which enables an agent to perform decidable reasoning with a first-order representation language and a stepwise procedure is included for improving approximate answers and allowing their convergence to the correct answer.
Anytime approximate model reasoning
TLDR
This paper builds an anytime proof procedure with a simple modification to classical modal tableaux that yields approximate proofs whose precision increases as the authors have more resources and analyzes its semantical and computational "quality guarantees".
Anytime Approximate Modal Reasoning
TLDR
This paper builds an anytime proof procedure with a simple modification to classical modal tableaux that yields approximate proofs whose precision increases as the authors have more resources and analyzes its semantical and computational “quality guarantees”.
A Non-Deterministic Semantics for Tractable Inference
TLDR
This work proposes a 3-valued semantics for a tractable fragment of propositional logic that is inherently non-deterministic: theDenotation of a formula is not uniquely determined by the denotation of the variables it contains.
Foundations of a Functional Approach to Knowledge Representation
  • H. Levesque
  • Computer Science, Philosophy
    Artif. Intell.
  • 1984
...
...