450 search results - page 13 / 90 » Satisfiability with Exponential Families |
94
Voted
ECCC
2007
14 years 9 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
102
click to vote
JAR
2006
14 years 9 months ago
2006
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
EJC
2010
14 years 9 months ago
2010
We study two enumeration problems for up-down alternating trees, i.e., rooted labelled trees T, where the labels v1, v2, v3, . . . on every path starting at the root of T satisfy v...