Sciweavers

2084 search results - page 289 / 417
» Set Constraints in Logic Programming
Sort
View
DOLAP
2010
ACM
13 years 5 months ago
Using ontologies to discover fact IDs
Object identification is a crucial step in most information systems. Nowadays, we have many different ways to identify entities such as surrogates, keys and object identifiers. Ho...
Alberto Abelló, Oscar Romero
JAR
2006
236views more  JAR 2006»
13 years 8 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
SOCO
2009
Springer
14 years 2 months ago
Specifying and Composing Non-functional Requirements in Model-Based Development
Abstract. Non-functional requirements encompass important design concerns such as schedulability, security, and communication constraints. In model-based development they non-local...
Ethan K. Jackson, Dirk Seifert, Markus Dahlweid, T...
LICS
1992
IEEE
14 years 8 days ago
Asynchronous Communication in Process Algebra
d Abstract) Frank S. de Boer, Jan Willem Klopyz , Catuscia Palamidessiyx We study the paradigm of asynchronous process communication, as contrasted with the synchronous communicat...
Frank S. de Boer, Jan Willem Klop, Catuscia Palami...
WADT
1998
Springer
14 years 12 days ago
Non-deterministic Computations in ELAN
Abstract. The ELAN system is an environment for specifying and prototyping constraint solvers, theorem provers and deduction systems in general. It also provides a framework for ex...
Hélène Kirchner, Pierre-Etienne More...