450 search results - page 21 / 90 » Satisfiability with Exponential Families |
86
Voted
DLT
2010
14 years 11 months ago
2010
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
COMBINATORICS
2007
14 years 9 months ago
2007
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
In many types of planning algorithms distance heuristics play an important role. Most of the earlier works restrict to STRIPS operators, and their application to a more general lan...
140
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
COCO
2004
Springer
15 years 2 months ago
2004
Springer
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...