1743 search results - page 164 / 349 » Generalized Modal Satisfiability |
145
Voted
ESOP
2008
Springer
15 years 5 months ago
2008
Springer
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
125
click to vote
IJCAI
2007
15 years 5 months ago
2007
In order to evaluate ontology matching algorithms it is necessary to confront them with test ontologies and to compare the results with some reference. The most prominent comparis...
133
Voted
STAIRS
2008
15 years 5 months ago
2008
Abstract. Physical agents such as robots are generally constrained in their communication capabilities. In a multi-agent system composed of physical agents, these constraints have ...
124
Voted
AAAI
2004
15 years 4 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
134
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...