Filters








560,285 Hits in 4.9 sec

Data Abstraction in Coordination Constraints [chapter]

José Proença, Dave Clarke
2013 Communications in Computer and Information Science  
, with and without abstraction.  ...  To deal with a wider range of data types and operations, we abstract data and reduce the original constraint satisfaction problem to a SAT problem, based on a variation of predicate abstraction.  ...  More generally, our approach falls within the implicit programming paradigm [14] , wherein constraints specify the computation and SAT and SMT solvers perform the computation.  ... 
doi:10.1007/978-3-642-45364-9_14 fatcat:oesv4kuqxvdbph6ygtgwi4yvnq

Motion Abstraction and Mapping with Spatial Constraints [chapter]

Rama Bindiganavale, Norman I. Badler
1998 Lecture Notes in Computer Science  
A new technique is introduced to abstract and edit motion capture data with spatial constraints.  ...  The abstracted data is edited and applied to another agent of a different anthropometric size and similar action is executed while maintaining the constraints.  ...  P & C F S T Q I b a u R q New trajectory after abstraction Initial trajectory before abstraction ¢ ¡ ¤ £ r p ) w ! g k y V q w u j w u V j g ) ) w u f V ¦ g k u u ) Y r j s f !  ... 
doi:10.1007/3-540-49384-0_6 fatcat:4wz3fvd2xrhjzn6yeqnqmwwdru

Transforming and Refining Abstract Constraint Specifications [chapter]

Alan M. Frisch, Brahim Hnich, Ian Miguel, Barbara M. Smith, Toby Walsh
2005 Lecture Notes in Computer Science  
A problem may be viewed and transformed at various levels of abstraction. It is often easier to transform an abstract specification rather than a concrete model.  ...  We illustrate this point by means of the SONET problem, a realistic combinatorial optimisation problem, which is transformed and subsequently refined into a number of constraint models.  ...  Acknowledgements Brahim Hnich and Toby Walsh are supported by Science Foundation Ireland. Ian Miguel is supported by a UK-Royal Academy of Engineering/EPSRC Post-doctoral Fellowship.  ... 
doi:10.1007/11527862_6 fatcat:eiuj5yekzzhc5hzlksdpzojrxy

Proximity constraints and representable trees (extended abstract) [chapter]

Prosenjit Bose, Giuseppe Battista, William Lenhart, Giuseppe Liotta
1995 Lecture Notes in Computer Science  
This paper examines an in nite family of proximity drawings of graphs called open and closed -drawings, rst de ned by Kirkpatrick and Radke 15, 21] in the context of computational morphology.  ...  Such proximity drawings include as special cases the well-known Gabriel, relative neighborhood and strip drawings. Complete characterizations of those trees that admit open -drawings for 0  ...  Lubiw and Sleumer 16] show that maximal outerplanar graphs admit both 1]-drawings (Gabriel drawings) and (2)-drawings (relative neighborhood drawings).  ... 
doi:10.1007/3-540-58950-3_389 fatcat:uqo7cfmq5rdh3a43jxnlpk3oa4

A Fully Abstract Semantics for Concurrent Constraint Programming

Sven-Olof Nyström, Bengt Jonsson
1998 Information and Computation  
Thus, we do not need to specify the valuations for conjunctions and existential quantifications in the definition of a pre-constraint system. Example 2.2. Let C be the set of natural numbers.  ...  X=Y _ X , ,7 Given an assignment V, formulas , and , and variables X and Y, we expect the valuation < to satisfy the following.  ...  A compositional and fully abstract semantics for concurrent constraint programming is developed.  ... 
doi:10.1006/inco.1998.2738 fatcat:xljj2aaafneenb6i64yyq72co4

Information-Theoretic Abstractions for Planning in Agents with Computational Constraints [article]

Daniel T. Larsson and Dipankar Maity and Panagiotis Tsiotras
2021 arXiv   pre-print
In this paper, we develop a framework for path-planning on abstractions that are not provided to the agent a priori but instead emerge as a function of the available computational resources.  ...  The properties of the problem are analyzed, and a number of theoretical results are presented and discussed.  ...  Acknowledgments Support for this work has been provided by ONR awards N00014-18-1-2375 and N00014-18-1-2828 and by ARL under DCIST CRA W911NF-17-2-018.  ... 
arXiv:2005.09611v2 fatcat:t6e5vyq6xvby5puqtamazu765q

Constraints and changes: A survey of abstract argumentation dynamics

Sylvie Doutre, Jean-Guy Mailly
2018 Argument & Computation  
The system consists in (1) an argumentation framework, made up, notably, of a set of arguments and of an attack relation, (2) an evaluation semantics, and (3) the evaluation result, computed from (1) and  ...  The paper surveys existing approaches for the dynamic enforcement of a constraint and its consequences, and reveals challenging enforcement cases that remain to be investigated.  ...  This principle is abstract, and can be instanciated by fixing the values of x and y.  ... 
doi:10.3233/aac-180425 fatcat:rlavjn4mezfarag6tysysbzjr4

Constraint Propagation: Between Abstract Models and ad hoc Strategies [chapter]

Laurent Granvilliers, Eric Monfroy
2000 Lecture Notes in Computer Science  
Acknowledgements The authors are grateful to Frédéric Benhamou, Frédéric Goualard, and Gaétan Hains.  ...  Introduction Constraint propagation [10, 7, 5] (CP) is a cornerstone algorithm of constraint programming, mainly devoted to the computation of local consistency properties of constraint satisfaction  ...  Since there is no alternative between abstract models and ad hoc strategies, the design of a new strategy requires the program to be developed from top to bottom and to be proved confluent and terminating  ... 
doi:10.1007/3-540-45349-0_39 fatcat:6qgbuoglzzgljo6t6zm5vw4m6y

Abstract Verification and Debugging of Constraint Logic Programs [chapter]

Manuel Hermenegildo, Germán Puebla, Francisco Bueno, Pedro López-García
2003 Lecture Notes in Computer Science  
In the case of Constraint Logic Programs (CLP), a comparatively large body of approximation domains, inference techniques, and tools for abstract interpretation-based semantic analysis have been developed  ...  The technique of Abstract Interpretation [13] has allowed the development of sophisticated program analyses which are provably correct and practical.  ...  Acknowledgments: This work has been funded in part by MCYT projects CUBICO (TIC02-0055), EDIPIA (TIC99-1151) and ADELA (HI2000-0043), and by EU IST FET project ASAP (IST-2001-38059).  ... 
doi:10.1007/3-540-36607-5_1 fatcat:rz5h5tjbzvhjng3n2iqgbtwfla

Resource Allocation in Networks Using Abstraction and Constraint Satisfaction Techniques [chapter]

Christian Frei, Boi Faltings
1999 Lecture Notes in Computer Science  
Most work on constraint satisfaction problems (CSP) starts with a standard problem de nition and focuses on algorithms for nding solutions.  ...  We show how an abstraction technique results in tractable formulations and makes the machinery of CSP applicable to this problem.  ...  The authors are grateful to Dean Allemang, Beat Liver, Steven Willmott, and Monique Calisti for their invaluable comments, suggestions, and encouragements during the last years.  ... 
doi:10.1007/978-3-540-48085-3_15 fatcat:oj2y24n3rfcg7liphshhokuhwa

Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming [chapter]

Giorgio Delzanno, Roberto Giacobazzi, Francesco Ranzato
2010 Lecture Notes in Computer Science  
We survey here some general notions and methods -in particular abstract interpretation and model checking -for analysing and verifying programs and systems, especially focused to (constraint) logic programs  ...  like AF and EF can be computed as least fixpoints.  ... 
doi:10.1007/978-3-642-14309-0_7 fatcat:pi5k44jpdfenzpf65lwfm3n5cm

Discovery of constraints and data dependencies in relational databases (Extended abstract) [chapter]

Siegfried Bell, Peter Brockhausen
1995 Lecture Notes in Computer Science  
Introduction Data dependencies are the most common type of semantic constraints in relational databases which determine the database design.  ...  Fig. 1 . 1 A SQL-statement for the Computation of Functional Dependencies Savnik and Flach Schlimmer Bell and Brockh. Lymphography 150 Bell and Brockh. Breast Cancer 699 Bell and Brockh.  ... 
doi:10.1007/3-540-59286-5_64 fatcat:imjelub44jblpfhawgpqbpr3j4

Computing the Ramsey number R(4,3,3) using abstraction and symmetry breaking

Michael Codish, Michael Frank, Avraham Itzhakov, Alice Miller
2016 Constraints  
This paper presents a methodology based on abstraction and symmetry breaking that applies to solve hard graph edge-coloring problems.  ...  The utility of this methodology is demonstrated by using it to compute the value R(4, 3, 3) = 30.  ...  Acknowledgements We thank Stanislaw Radziszowski for his guidance and comments which helped improve the presentation of this paper.  ... 
doi:10.1007/s10601-016-9240-3 fatcat:qhryaicqgfc7tedjgte27wxf4a

Making Maximum Entropy Computations Easier By Adding Extra Constraints (Extended Abstract) [chapter]

Sally A. Goldman, Ronald L. Rivest
1988 Maximum-Entropy and Bayesian Methods in Science and Engineering  
We s h o w h o w adding constraints and performing the associated additional tabulations can substantially speed up computation by replacing the usual iterative techniques with a straight-forward computation  ...  This paper presents a new way to compute the probability distribution with maximum entropy satisfying a set of constraints.  ...  If the constraint is not satis ed, the relevant is multiplied by the ratio of the desired sum to the computed sum.  ... 
doi:10.1007/978-94-010-9054-4_18 fatcat:34mfydfhknay3pkjpalnph6uya

Constraint-Based Abstract Semantics for Temporal Logic: A Direct Approach to Design and Implementation [chapter]

Gourinath Banda, John P. Gallagher
2010 Lecture Notes in Computer Science  
Then we show that this leads directly to an effective implementation of an abstract model checking algorithm for CTL using abstract domains based on linear constraints.  ...  The abstract semantic function is constructed directly from the standard concrete semantics together with a Galois connection between the concrete state-space and an abstract domain.  ...  We gratefully acknowledge discussions with Dennis Dams, César Sánchez, Kim Guldstrand Larsen and suggestions by the LPAR-16 referees.  ... 
doi:10.1007/978-3-642-17511-4_3 fatcat:fqim7etzrnaf7gbljd2x7quobe
« Previous Showing results 1 — 15 out of 560,285 results