We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs). This problem has received much attention in the ontology management and DL communit...
In a hypothesis-based approach to digital investigation, the investigator formulates his hypothesis about which events took place, and tests them using the evidence available. A f...
This paper describes a tutorial program that serves a double role as an educational tool and a research environment. First, it introduces students to fundamental concepts of propo...
We present an approach to knowledge compilation that transforms a function-free first-order Horn knowledge base to propositional logic. This form of compilation is important since...
Helmut Prendinger, Mitsuru Ishizuka, Gerhard Schur...
Qualitative choice logic (QCL) is a propositional logic for representing alternative, ranked options for problem solutions. The logic adds to classical propositional logic a new c...
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
We present a propositional logic to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability ...