Sciweavers

509 search results - page 45 / 102
» On the completeness of compositional reasoning methods
Sort
View
LPAR
2012
Springer
12 years 4 months ago
E-Matching with Free Variables
E-matching is the most commonly used technique to handle quantifiers in SMT solvers. It works by identifying characteristic subexpressions of quantified formulae, named triggers,...
Philipp Rümmer
CADE
2012
Springer
11 years 11 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
LAWEB
2006
IEEE
14 years 2 months ago
Policy Support for Business-oriented Web Service Management
Policies have been adopted for many reasons within web services and Service-oriented Architecture in general. However, while they are a favoured method of management, this only oc...
Stephen Gorton, Stephan Reiff-Marganiec
AAAI
1997
13 years 10 months ago
Building Concept Representations from Reusable Components
Our goal is to build knowledge-based systems capable of answering a wide variety of questions, including questions that are unanticipated when the knowledge base is built. For sys...
Peter Clark, Bruce W. Porter
ICEXSS
2010
13 years 3 months ago
Systemic Service Design: Aligning Value and Implementation
The promise of service orientation is that it enables an organization to prosper by delivering continuous value to customers. This prosperity is of strategic value to the organizat...
Arash Golnam, Gil Regev, Julien Ramboz, Philippe L...