3776 search results - page 655 / 756 » Partition-Based Logical Reasoning |
CADE
2004
Springer
14 years 1 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
The Parameterized Model Checking Problem (PMCP) is to decide whether a temporal property holds for a uniform family of systems, ¢¡ , comprised of finite, but arbitrarily many,...
ER
2004
Springer
14 years 1 months ago
2004
Springer
A major issue in the study of semantic Web services concerns the matching problem of Web services. Various techniques for this problem have been proposed. Typical ones include FSM ...
CSFW
2002
IEEE
14 years 26 days ago
2002
IEEE
We introduce a general framework for reasoning about secrecy requirements in multiagent systems. Because secrecy requirements are closely connected with the knowledge of individua...
KR
2010
Springer
14 years 20 days ago
2010
Springer
Handling exceptions in a knowledge-based system has been considered as an important issue in many domains of applications, such as medical domain. In this paper, we propose severa...