42 search results - page 7 / 9 » Algorithms for computing backbones of propositional formulae |
142
Voted
IJAR
2010
15 years 2 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
145
Voted
TABLEAUX
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
124
Voted
LOGCOM
2002
15 years 3 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
137
Voted
ACSD
2007
IEEE
15 years 5 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...
148
Voted
TACAS
2007
Springer
15 years 9 months ago
2007
Springer
ion Randal E. Bryant1 , Daniel Kroening2 , Jo¨el Ouaknine3 , Sanjit A. Seshia4 , Ofer Strichman5 , and Bryan Brady4 1 Carnegie Mellon University, Pittsburgh 2 ETH Z¨urich 3 Oxfor...