Sciweavers

189 search results - page 18 / 38
» Similarity-Guided Clause Generalization
Sort
View
TABLEAUX
2009
Springer
15 years 4 months ago
Tableaux for Projection Computation and Knowledge Compilation
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
Christoph Wernhard
CORR
1998
Springer
145views Education» more  CORR 1998»
14 years 11 months ago
Anchoring a Lexicalized Tree-Adjoining Grammar for Discourse
We here explore a "fully" lexicalized Tree-Adjoining Grammar for discourse that takes the basic elements of a (monologic) discourse to be not simply clauses, but larger ...
Bonnie L. Webber, Aravind K. Joshi
CP
2010
Springer
14 years 10 months ago
Computing the Density of States of Boolean Formulas
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
Stefano Ermon, Carla P. Gomes, Bart Selman
JLP
2010
105views more  JLP 2010»
14 years 6 months ago
Quantitative analysis of weighted transition systems
We present a general framework for the analysis of quantitative and qualitative properties of reactive systems, based on a notion of weighted transition systems. We introduce and ...
Claus R. Thrane, Uli Fahrenberg, Kim G. Larsen
IJCAI
1989
15 years 28 days ago
Recognizing Unnecessary Inference
Intelligent reasoners sometimes draw conclusions that lack new or relevant information. Similarly, automated reasoning systems can produce formulas that are not necessary for the ...
Dan Benanav