Sciweavers

Share
JAIR
2011
166views more  JAIR 2011»
7 years 10 months ago
Decidability and Undecidability Results for Propositional Schemata
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...
DLOG
2009
8 years 1 months ago
Revision of DL-Lite Knowledge Bases
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...
Zhe Wang, Kewen Wang, Rodney W. Topor
SAC
2008
ACM
8 years 2 months ago
Using simplified event calculus in digital investigation
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...
Svein Yngvar Willassen
SIGCSE
2002
ACM
202views Education» more  SIGCSE 2002»
8 years 3 months ago
A tutorial program for propositional logic with human/computer interactive learning
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...
Stacy Lukins, Alan Levicki, Jennifer Burg
IJPRAI
2000
108views more  IJPRAI 2000»
8 years 3 months ago
Knowledge Base Reformation: Preparing First-Order Theories for Efficient Propositional Reasoning
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...
AI
2004
Springer
8 years 3 months ago
Qualitative choice logic
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...
Gerhard Brewka, Salem Benferhat, Daniel Le Berre
LMCS
2006
126views more  LMCS 2006»
8 years 3 months ago
The Completeness of Propositional Resolution: A Simple and Constructive Proof
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...
Jean H. Gallier
JSYML
2006
124views more  JSYML 2006»
8 years 3 months ago
Glivenko theorems for substructural logics over FL
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...
Nikolaos Galatos, Hiroakira Ono
AAAI
1998
8 years 4 months ago
A Non-Deterministic Semantics for Tractable Inference
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...
James M. Crawford, David W. Etherington
UAI
2001
8 years 4 months ago
A Logic for Reasoning about Upper Probabilities
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 ...
Joseph Y. Halpern, Riccardo Pucella
books