91 search results - page 18 / 19 » Reducts of Propositional Theories, Satisfiability Relations,... |
ACSC
2002
IEEE
13 years 10 months ago
2002
IEEE
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 ...
PPDP
2005
Springer
13 years 11 months ago
2005
Springer
We present ReactiveML, a programming language dedicated to the implementation of complex reactive systems as found in graphical user interfaces, video games or simulation problems...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
Schema merging is the process of consolidating multiple schemas into a unified view. The task becomes particularly challenging when the schemas are highly heterogeneous and autono...
POPL
2006
ACM
14 years 5 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...