Sciweavers

144 search results - page 27 / 29
» On meta complexity of propositional formulas and proposition...
Sort
View
AAAI
2008
13 years 9 months ago
Lifted First-Order Belief Propagation
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
Parag Singla, Pedro Domingos
AAMAS
2008
Springer
13 years 7 months ago
Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces
Abstract. We present a novel logic-based framework to automate multi-issue bilateral negotiation in e-commerce settings. The approach exploits logic as communication language among...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
JAR
2006
101views more  JAR 2006»
13 years 7 months ago
Checking Consistency and Completeness of On-Line Product Manuals
Abstract. As products are growing more complex, so is their documentation. With an increasing number of product options, the diversity in service and maintenance procedures grows a...
Carsten Sinz, Wolfgang Küchlin, Dieter Feicht...
IJAR
2010
91views more  IJAR 2010»
13 years 6 months ago
Logical and algorithmic properties of stable conditional independence
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
Mathias Niepert, Dirk Van Gucht, Marc Gyssens
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 5 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki