Sciweavers

509 search results - page 12 / 102
» On the completeness of compositional reasoning methods
Sort
View
DATE
2005
IEEE
106views Hardware» more  DATE 2005»
14 years 1 months ago
SAT-Based Complete Don't-Care Computation for Network Optimization
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
Alan Mishchenko, Robert K. Brayton
SAC
2009
ACM
14 years 2 months ago
Applying Reo to service coordination in long-running business transactions
Ensuring transactional behavior of business processes and web service compositions is an essential issue in the area of serviceoriented computing. Transactions in this context may ...
Natallia Kokash, Farhad Arbab
ICCBR
2009
Springer
14 years 2 months ago
A Value Supplementation Method for Case Bases with Incomplete Information
Abstract. In this paper we present a method for supplementing incomplete cases with information from other cases within a case base. The acquisition of complete and correct cases i...
Kerstin Bach, Meike Reichle, Klaus-Dieter Althoff
FMCAD
2006
Springer
13 years 11 months ago
Thorough Checking Revisited
Recent years have seen a proliferation of 3-valued or capturing abstractions of systems, since these enable verifying both universal and existential properties. Reasoning about suc...
Shiva Nejati, Mihaela Gheorghiu, Marsha Chechik
IJCAI
2003
13 years 9 months ago
Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies
Current Description Logic reasoning systems provide only limited support for debugging logically erroneous knowledge bases. In this paper we propose new non-standard reasoning ser...
Stefan Schlobach, Ronald Cornet