725 search results - page 111 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
122
click to vote
CONCUR
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Reactive Systems `a la Leifer and Milner allow to derive from a reaction semantics definition an LTS equipped with a bisimilarity relation which is a congruence. This th...
150
click to vote
WWW
2003
ACM
16 years 3 months ago
2003
ACM
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...
133
click to vote
IJCAI
1997
15 years 3 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...
107
click to vote
APCSAC
2004
IEEE
15 years 6 months ago
2004
IEEE
In the context of general-purpose processing, an increasing number of diverse functional units are added to cover a wide spectrum of applications. However, it is still possible to ...
129
Voted
PODS
2007
ACM
16 years 2 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...