Sciweavers

4949 search results - page 183 / 990
» Consistency and Set Intersection
Sort
View
149
Voted
CPAIOR
2006
Springer
15 years 8 months ago
Open Constraints in a Closed World
We study domain filtering algorithms for open constraints, i.e., constraints that are not a priori defined on specific sets of variables. We present an efficient filtering algorith...
Willem Jan van Hoeve, Jean-Charles Régin
IPL
2006
99views more  IPL 2006»
15 years 5 months ago
Computational complexity of queries based on itemsets
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Nikolaj Tatti
ACSC
2002
IEEE
15 years 10 months ago
Representation and Reasoning for Goals in BDI Agents
A number of agent-oriented programming systems are based on a framework of beliefs, desires and intentions (BDI) and more explicitly on the BDI logic of Rao and Georgeff. In this ...
John Thangarajah, Lin Padgham, James Harland
121
Voted
APAL
2006
67views more  APAL 2006»
15 years 5 months ago
Adding clubs with square
We present a technique for destroying stationary subsets of P+ using partial square sequences. We combine this method with Gitik's poset for changing the cofinality of a cardi...
John Krueger
DCC
2008
IEEE
16 years 4 months ago
On Boolean functions with the sum of every two of them being bent
A set of Boolean functions is called a bent set if the sum of any two distinct members is a bent function. We show that any bent set yields a homogeneous system of linked symmetric...
Christian Bey, Gohar M. M. Kyureghyan