91 search results - page 12 / 19 » On Computing Backbones of Propositional Theories |
105
click to vote
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded m...
SARA
2000
Springer
15 years 5 months ago
2000
Springer
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...
137
click to vote
AAAI
2000
15 years 3 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
DIS
2003
Springer
15 years 7 months ago
2003
Springer
Computing abductive explanations is an important problem, which has been studied extensively in Artificial Intelligence (AI) and related disciplines. While computing some abductiv...
SAT
2004
Springer
15 years 7 months ago
2004
Springer
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...