Sciweavers

Share
91 search results - page 1 / 19
» On Computing Backbones of Propositional Theories
Sort
View
ECAI
2010
Springer
10 years 1 months ago
On Computing Backbones of Propositional Theories
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
João Marques-Silva, Mikolás Janota, ...
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
10 years 10 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
CSL
2003
Springer
10 years 9 months ago
Generating All Abductive Explanations for Queries on Propositional Horn Theories
Abstract. Abduction is a fundamental mode of reasoning, which has taken on increasing importance in Artiļ¬cial Intelligence (AI) and related disciplines. Computing abductive expla...
Thomas Eiter, Kazuhisa Makino
LANMR
2004
10 years 5 months ago
Computing Preferred Safe Beliefs
We recently proposed a definition of a language for nonmonotonic reasoning based on intuitionistic logic. Our main idea is a generalization of the notion of answer sets for arbitr...
Luis A. Montiel, Juan A. Navarro
LPNMR
2007
Springer
10 years 10 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
books