Filters








74 Hits in 8.6 sec

Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors

Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak, Laurent D. Michel
2021
Sioutis and Janhunen (KI, 2019) have proposed a generalised backdoor concept suitable for infinite-domain CSP instances over binary constraints.  ...  Backdoors have found many applications in artificial intelligence and elsewhere, and the algorithmic problem of finding such backdoors has consequently been intensively studied.  ...  C P 2 0 2 1 32:10 Algorithms and Lower Bounds for Backdoors for Infinite-Domain CSPs ▶ Lemma 12. ( * ) Assume R is JEPD and that Γ is qffo-definable in R.  ... 
doi:10.4230/lipics.cp.2021.32 fatcat:pw75vyro25cjho23vylnlqobdq

Backdoors to Combinatorial Optimization: Feasibility and Optimality [chapter]

Bistra Dilkina, Carla P. Gomes, Yuri Malitsky, Ashish Sabharwal, Meinolf Sellmann
2009 Lecture Notes in Computer Science  
There has been considerable interest in the identification of structural properties of combinatorial problems that lead, directly or indirectly, to the development of efficient algorithms for solving them  ...  We show that finding a feasible solution and proving optimality are characterized by backdoors of different kinds and size.  ...  Background: Backdoors for Constraint Satisfaction We begin by recalling the concept of weak and strong backdoor sets for constraint satisfaction problems.  ... 
doi:10.1007/978-3-642-01929-6_6 fatcat:hf7j4saeo5hxvgjpya7e5634cm

Combining Treewidth and Backdoors for CSP [article]

Robert Ganian and M. S. Ramanujan and Stefan Szeider
2016 arXiv   pre-print
This result combines the two prominent approaches for achieving tractability for CSP: (i) by structural restrictions on the interaction between the variables and the constraints and (ii) by language restrictions  ...  Apart from defining the notion of backdoor-treewidth and showing how backdoors of small treewidth can be used to efficiently solve CSP, our main technical contribution is a fixed-parameter algorithm that  ...  The Constraint Satisfaction Problem (CSP, for short) asks, given a finite set I of constraints, whether I is satisfiable.  ... 
arXiv:1610.03298v1 fatcat:nt7sor3crfggzgy4a2w42xdw2m

Approximation Algorithms [chapter]

2016 Algorithms  
polynomially) that is guaranteed to find an optimal solution for such problems.  ...  Examples of NP-hard optimization tasks are the minimum traveling salesman problem, the minimum graph coloring problem, and the minimum bin packing  ...  APPROXIMATION ALGORITHMS  ... 
doi:10.1142/9789814723657_0014 fatcat:6mnqrk3aafh7xla6x4pqxejmby

Harnessing tractability in constraint satisfaction problems Directeur(s) de Thèse : Membre(s) du jury

M Martin, Cooper Emmanuel, Hebrard Rapporteurs, Nadia Mme, Aix-Marseille Creignou, Président Universite, Laas Hebrard, Membre Toulouse, Paul Cooper, Membre Sabatier, Jegou
unpublished
Through countless discussions, he has shaped my scientific mind and prepared me for the world of academic research. It has been a pleasure and an honour working with him.  ...  Emmanuel was always there to guide me, answer my questions, comment on my research and support me in the difficult moments; he really took his supervision role to heart and worked hard to ensure I do my  ...  The latter takes its values in the sets that are supersets of a lower bound S and subsets of an upper bound S.  ... 
fatcat:t3c7mmehpzhp7g2326ogtselbu

Limitations of restricted branching in clause learning

Matti Järvisalo, Tommi Junttila
2009 Constraints  
The techniques for making decisions, that is, branching, play a central role in complete methods for solving structured instances of constraint satisfaction problems (CSPs).  ...  Theoretically, however, restricting branching to input variables implies a super-polynomial increase in the length of the optimal proofs for DPLL (without clause learning), and thus input-restricted DPLL  ...  Acknowledgements We thank Ilkka Niemelä for numerous discussions on the topic of this work, and Emilia Oikarinen for help on the resolution proof construction in Appendix.  ... 
doi:10.1007/s10601-008-9062-z fatcat:2xgxuaconvba3emimel2buhj4q

Types and trace effects for object orientation

Christian Skalka
2008 Higher-Order and Symbolic Computation  
We propose an expressive type and effect inference algorithm combining polymorphism and subtyping/subeffecting constraints to obtain a flexible trace effect analysis in this setting, and show how these  ...  In this paper we develop a type and effect analysis for obtaining trace effects of Object Oriented programs in Featherweight Java.  ...  Acknowledgements The author would like to thank David Van Horn, Scott Smith, and anonymous referees for their helpful comments on drafts of this paper.  ... 
doi:10.1007/s10990-008-9032-6 fatcat:ycgmxpcawzcupdyai4fd5r4ov4

A framework for good SAT translations, with applications to CNF representations of XOR constraints [article]

Matthew Gwynne, Oliver Kullmann
2014 arXiv   pre-print
We obtain general upper and lower bounds. Applied to systems of XOR-constraints, we show a super-polynomial lower bound on "good" representations under very general circumstances.  ...  A corresponding upper bound shows fixed-parameter tractability in the number of constraints.  ...  We assume (to simplify the presentation) |I| ≥ 2, |C| > |I| and |D| > |I|; thus w.l.o.g. C ∩ D = I. Acknowledgements.  ... 
arXiv:1406.7398v2 fatcat:7rmxe4malfcw7pqxmxgxliokq4

A Roadmap for Big Model [article]

Sha Yuan, Hanyu Zhao, Shuai Zhao, Jiahong Leng, Yangxiao Liang, Xiaozhi Wang, Jifan Yu, Xin Lv, Zhou Shao, Jiaao He, Yankai Lin, Xu Han (+88 others)
2022 arXiv   pre-print
, Commonsense Reasoning, Reliability&Security, Governance, Evaluation, Machine Translation, Text Generation, Dialogue and Protein Research.  ...  In this paper, we cover not only the BM technologies themselves but also the prerequisites for BM training and applications with BMs, dividing the BM review into four parts: Resource, Models, Key Technologies  ...  First, generalization bound for classification with scoring functions has not been formally studied in domain adaptation.  ... 
arXiv:2203.14101v4 fatcat:rdikzudoezak5b36cf6hhne5u4

A Survey of Symbolic Execution Techniques

Roberto Baldoni, Emilio Coppa, Daniele Cono D'elia, Camil Demetrescu, Irene Finocchi
2018 ACM Computing Surveys  
The goal of this survey is to provide an overview of the main ideas, challenges, and solutions developed in the area, distilling them for a broad audience.  ...  For instance, a tool for identifying software vulnerabilities may need to rule out the existence of any backdoor to bypass a program's authentication.  ...  CONSTRAINT SOLVING Constraint satisfaction problems arise in many domains, including analysis, testing, and verification of software programs.  ... 
doi:10.1145/3182657 fatcat:h6kadibzkvevxa3lgzdtdokq74

A Survey of Symbolic Execution Techniques [article]

Roberto Baldoni, Emilio Coppa, Daniele Cono D'Elia, Camil Demetrescu, Irene Finocchi
2018 arXiv   pre-print
The goal of this survey is to provide an overview of the main ideas, challenges, and solutions developed in the area, distilling them for a broad audience.  ...  For instance, a tool for identifying software vulnerabilities may need to rule out the existence of any backdoor to bypass a program's authentication.  ...  CONSTRAINT SOLVING Constraint satisfaction problems arise in many domains, including analysis, testing, and verification of software programs.  ... 
arXiv:1610.00502v3 fatcat:zez6xtyiuna6rgv7ola3nzxmty

Editors: Heribert Vollmer and Brigitte Vallée; Article No. 36

Robert Ganian, Ramanujan, Stefan Szeider
17 Leibniz International Proceedings in Informatics Schloss Dagstuhl-Leibniz-Zentrum für Informatik   unpublished
finds a backdoor of small treewidth. 1 Introduction The Constraint Satisfaction Problem (CSP) is a central and generic computational problem which provides a common framework for many theoretical and  ...  Apart from defining the notion of backdoor-treewidth and showing how backdoors of small treewidth can be used to efficiently solve CSP, our main technical contribution is a fixed-parameter algorithm that  ...  The Constraint Satisfaction Problem (CSP, for short) asks, given a finite set I of constraints, whether I is satisfiable.  ... 
fatcat:yotu74q62nguvc5jxnxvtwqam4

Methods for solving reasoning problems in abstract argumentation – A survey

Günther Charwat, Wolfgang Dvořák, Sarah A. Gaggl, Johannes P. Wallner, Stefan Woltran
2015 Artificial Intelligence  
In this survey, we give an overview on different methods for solving reasoning problems in abstract argumentation and compare their particular features.  ...  argumentation Algorithms Argumentation systems Within the last decade, abstract argumentation has emerged as a central field in Artificial Intelligence.  ...  The authors are grateful to the anonymous reviewers for their detailed reviews and helpful comments as well as to all colleagues who discussed their works and systems with the authors.  ... 
doi:10.1016/j.artint.2014.11.008 pmid:25737590 pmcid:PMC4318991 fatcat:qrw6bic4vjc5zdqkvi5tlhcs7m

Front Matter, Table of Contents, Preface, Conference Organization

Laurent D. Michel
2021
: Function Optimization Using Implicit Hitting Sets Mikoláš Janota, António Morgado, José Fragoso Santos, and Vasco Manquinho . . 31:1-31:16 Reasoning Short Cuts in Infinite Domain Constraint Satisfaction  ...  : Algorithms and Lower Bounds for Backdoors Peter Jonsson, Victor Lagerkvist, and Sebastian Ordyniak . . . . . . . . . . . . . . . . . . . . . . . 32:1-32:20 Jeremias Berg, and Matti Järvisalo . . . .  ... 
doi:10.4230/lipics.cp.2021.0 fatcat:m3sk7eacnfdnzpaahjew2fhxgq

Cost-to-Go Function Approximation [chapter]

2017 Encyclopedia of Machine Learning and Data Mining  
Mitchell's, (1982; candidate-elimination algorithm performs a bidirectional search in the hypothesis space.  ...  It maintains a set, S , of most specific hypotheses that are consistent with the training data and a set, G, of most general hypotheses consistent with the training data.  ...  Some algorithms, most notably CN2 (Clark and Niblett 1989; Clark and Boswell 1991) , learn multi-class rules directly by optimizing overall possible classes in the head of the rule.  ... 
doi:10.1007/978-1-4899-7687-1_100093 fatcat:vse7ncdqs5atlosjhz7fhlj3im
« Previous Showing results 1 — 15 out of 74 results