Sciweavers

570 search results - page 67 / 114
» The Complexity of Reasoning with Global Constraints
Sort
View
ICLP
1997
Springer
15 years 1 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
LPNMR
1997
Springer
15 years 1 months ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian
ER
2010
Springer
132views Database» more  ER 2010»
14 years 7 months ago
Full Satisfiability of UML Class Diagrams
UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constraints expr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
CCGRID
2002
IEEE
15 years 2 months ago
Towards an Economy-Based Optimisation of File Access and Replication on a Data Grid
We are working on a system for the optimised access and replication of data on a Data Grid. Our approach is based on the use of an economic model that includes the actors and the ...
Mark James Carman, Floriano Zini, Luciano Serafini...
ICC
2007
IEEE
170views Communications» more  ICC 2007»
15 years 4 months ago
Evaluating Techniques for Network Layer Independence in Cognitive Networks
— Cognitive networks are the latest progression of cognitive functionality into the networking stack, an effort which began with a layer one and two focus on cognitive radios, an...
Muthukumaran Pitchaimani, Benjamin J. Ewy, Joseph ...