Sciweavers

241 search results - page 9 / 49
» Propositional knowledge and know-how
Sort
View
IJCAI
1993
14 years 11 months ago
The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...
Thomas Eiter, Georg Gottlob
CORR
2006
Springer
120views Education» more  CORR 2006»
14 years 9 months ago
Reasoning About Knowledge of Unawareness
Awareness has been shown to be a useful addition to standard epistemic logic for many applications. However, standard propositional logics for knowledge and awareness cannot expre...
Joseph Y. Halpern, Leandro Chaves Rêgo
SYNASC
2006
IEEE
64views Algorithms» more  SYNASC 2006»
15 years 3 months ago
Scheme-Based Systematic Exploration of Natural Numbers
In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by ...
Madalina Hodorog, Adrian Craciun
ECSQARU
2001
Springer
15 years 2 months ago
Reasoning about Knowledge Using Rough Sets
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
Weiru Liu
ICTAI
2005
IEEE
15 years 3 months ago
Good Learning and Implicit Model Enumeration
A large number of practical applications rely on effective algorithms for propositional model enumeration and counting. Examples include knowledge compilation, model checking and ...
António Morgado, João P. Marques Sil...