A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Tractability in constraint satisfaction problems: a survey
2015
Constraints
Preserved Fulltext
Acknowledgments We are grateful to Peter Jeavons and StanislavŽivný for their detailed comments on a first draft of this paper, and to the reviewers for their constructive comments. ...
Aside from the restrictions on d and r, de Haan, Kanj and Szeider have provided a more fine-grained analysis of the subexponential time complexity of CSP by considering restrictions on the number of tuples ...
Here we only detail the complexity of the basic recognition problem which has no restriction on the input language. ...
doi:10.1007/s10601-015-9198-6
fatcat:fl7kxmceh5bqzpyd2c37rtohii
Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms?
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Via an algebraic connection, this reduces to the study of restricted partial polymorphisms of Γ we refer to as pSDI-operations (for partial, self-dual and idempotent). ...
We study the complexity of SAT(Γ) problems for potentially infinite languages Γ closed under variable negation (sign-symmetric languages). ...
The applicability of partial polymorphism in the context of fine-grained time complexity might not be evident from these definitions. ...
arXiv:1801.09488v1
fatcat:377d4h6ogbgqhimp23eylfpjsu
Weak bases of Boolean co-clones
2014
Information Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this thesis we study the worst-case time complexity of the constraint satisfaction problem parameterized by a constraint language (CSP(S)), which is the problem of determining whether a conjunctive ...
We then proceed to study the computational complexity of two optimisation variants of the SAT(S) problem: the maximum ones problem over a Boolean constraint language S (MAX-ONES(S)) and the valued constraint ...
the computational complexity of constraint satisfaction problems. ...
doi:10.1016/j.ipl.2014.03.011
fatcat:4rhokivpgnaxrptedshzn2emji
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We prove a trichotomy theorem for the generalized conjunctive query counting problem, showing this way that, contrary to the corresponding decision problems, constraint satisfaction and conjunctive-query ...
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. ...
Hemaspaandra and Vollmer [HV95] have introduced higher complexity counting classes using a predicate-based framework that focuses on the complexity of membership in the witness sets. ...
doi:10.1007/11527695_3
fatcat:pc7kel2r45ef3ketqmeq7dlkhi
Strong partial clones and the time complexity of SAT problems
2017
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Using clone theory we obtain a partial order ≤ on languages such that SAT(S) is CV-reducible to SAT(S ) if S ≤ S . ...
In this article we study the complexity of SAT(S) with reductions increasing the amount of variables by a constant (CV-reductions) or a constant factor (LV-reductions). ...
Acknowledgments We thank Magnus Wahlström for helpful discussions on the topic of this article, and in particular for suggesting the proof strategy in Lemma 17. ...
doi:10.1016/j.jcss.2016.07.008
fatcat:ydgat5j4f5errokt7zrdpn2yqi
Comparing and classifying model transformation reuse approaches across metamodels
2019
Journal of Software and Systems Modeling
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
For this purpose, we first report on a survey to understand the reuse approaches used currently in practice and the needs of the community. Then, we propose a classification of J-M. ...
modeling, mapping operators, constraint-based model types, and design patterns for model transformations -based on this feature model and a common example. ...
This work has been partially funded by the Spanish Ministry of Science (RTI2018-095255-B-I00) and the Madrid Region (S2018/TCS-4314). ...
doi:10.1007/s10270-019-00762-9
fatcat:rhgd7sdxvzb2rkd5jcdazpznta
Robust Satisfiability for CSPs
2013
ACM Transactions on Computation Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying at least a (1−f (ϵ))-fraction of constraints for each (1−ϵ)-satisfiable instance (i.e. such that ...
We establish an algebraic framework for analyzing constraint satisfaction problems admitting an efficient robust algorithm with functions f of a given growth rate. ...
The language-based direction is considerably more active than the structural one, and there are many partial language-based complexity classification results, e.g. ...
doi:10.1145/2540090
fatcat:25oavt5iyrfebaf5iyngqzadxu
A Language for Generic Programming in the Large
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
To address this need we developed the language G. The central feature of G is the concept, a mechanism for organizing constraints on generics that is inspired by the needs of modern C++ libraries. ...
In this article we present the rationale for the design of G and demonstrate the expressiveness of G with two case studies: porting the Standard Template Library and the Boost Graph Library from C++ to ...
This work was supported by NSF grants EIA-0131354 and CCF-0702362, and by a grant from the Lilly Endowment. ...
arXiv:0708.2255v1
fatcat:ssm3xegpyfau7oyrg2emt7vrs4
A language for generic programming in the large
2011
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To address this need we developed the language G. The central feature of G is the concept, a mechanism for organizing constraints on generics that is inspired by the needs of modern C++ libraries. ...
In this article we present the rationale for the design of G and demonstrate the expressiveness of G with two case studies: porting the Standard Template Library and the Boost Graph Library from C++ to ...
This work was supported by NSF grants EIA-0131354 and CCF-0702362, and by a grant from the Lilly Endowment. ...
doi:10.1016/j.scico.2008.09.009
fatcat:udnyr2hczngtvawsh5jbwzqd4m
The Complexity of Flow Analysis in Higher-Order Languages
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This dissertation proves lower bounds on the inherent difficulty of deciding flow analysis problems in higher-order programming languages. ...
We give exact characterizations of the computational complexity of 0CFA, the kCFA hierarchy, and related analyses. ...
The analysis takes the form of a constraint satisfaction problem and this satisfaction problem is shown to be complete for PTIME. See section 6.3 for further discussion. ...
arXiv:1311.4733v1
fatcat:ukzvizf2ujc6lcklv4wfdip2ee
Conflict-aware optimal scheduling of prioritised code clone refactoring
2013
IET Software
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Among many potential refactoring opportunities, the choice and order of a set of refactoring activities may have distinguishable effect on the design/code quality measured in terms of software metrics. ...
Second, the authors propose a constraint programming (CP) approach for conflict-aware optimal scheduling of code clone refactoring. ...
Acknowledgments The authors acknowledge the contributions of Ripon Saha, Muhammad Asaduzzaman, Sharif Uddin, Saidur Rahman, Manishankar Mondal and Mohammad Khan for participating in the study to empirically ...
doi:10.1049/iet-sen.2012.0058
fatcat:b3v3xivexfcszm5ystfxm34z3e
SimPL: A product-line modeling methodology for families of integrated control systems
2013
Information and Software Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We then derived a set of modeling requirements based on the findings of our domain analysis. The SimPL methodology is proposed to fulfill these requirements. ...
Our solution to the configuration problems consists of a UMLbased modeling methodology, named SimPL, and a semi-automated configuration approach. ...
We are grateful to FMC Technologies Inc. for their help on performing the industrial case study. ...
doi:10.1016/j.infsof.2012.09.006
fatcat:tpqeqj5cmvgqlpm6zym4tqdgcy
Formalizing the safety of Java, the Java virtual machine, and Java card
2001
ACM Computing Surveys
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
We review the existing literature on Java safety, emphasizing formal approaches, and the impact of Java safety on small footprint devices such as smartcards. ...
The conclusion is that although a lot of good work has been done, a more concerted effort is needed to build a coherent set of machine-readable formal models of the whole of Java and its implementation ...
., SLATER, A., AND VOGT, H. 1998. cardT A P : The first theorem prover on a smart card. In 15th Automated Deduction (CADE), LNCS 1421 (Lindau, Germany, July), pp. 47-50. Springer-Verlag, Berlin. ...
doi:10.1145/503112.503115
fatcat:xg4uc2jgjbdhpaxism3f6cr42i
Technologies for Evolvable Software Products: The Conflict between Customizations and Evolution
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The next section gives a detailed explanation of the upgrade problem. Then, section 3 gives a concrete example of this problem, through a study of two widely used ERP systems. ...
problems, and discuss whether they could be brought to bear on the conflict. ...
, and the IT University of Copenhagen. ...
doi:10.1007/978-3-540-89762-0_8
fatcat:vqysgncbvjfsheqkr3u4vjb6ku
Conflict Detection and Resolution in IoT Systems: A Survey
2022
IoT
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We detail the inherent complexities of the problem, survey the work already performed, and layout the future challenges. ...
We also highlight the significance of detecting/resolving conflicts proactively, i.e., dynamically but with a look-ahead into the future based on the context. ...
Conflicts of Interest: The authors declare no conflicts of interest. ...
doi:10.3390/iot3010012
fatcat:2xobygknerbxbfal27vmghsbyy
« Previous
Showing results 1 — 15 out of 455 results