Filters








21,541 Hits in 4.0 sec

Parameterized Complexity of Graph Constraint Logic

Tom C. Van Der Zanden, Marc Herbstritt
2015 International Symposium on Parameterized and Exact Computation  
We study the parameterized complexity of Constraint Graph Satisfiability and both bounded and unbounded versions of Nondeterministic Constraint Logic (NCL) with respect to solution length, treewidth and  ...  maximum degree of the underlying constraint graph as parameters.  ...  In this thesis, we study the (parameterized) complexity of Constraint Graph Satisfiability and its reconfiguration variant, Nondeterministic Constraint Logic.  ... 
doi:10.4230/lipics.ipec.2015.282 dblp:conf/iwpec/Zanden15 fatcat:b6zwiy3j6ra7bkv42dnpye5sp4

Parameterized Complexity of Graph Constraint Logic [article]

Tom C. van der Zanden
2015 arXiv   pre-print
We study the parameterized complexity of Constraint Graph Satisfiability and both bounded and unbounded versions of Nondeterministic Constraint Logic (NCL) with respect to solution length, treewidth and  ...  maximum degree of the underlying constraint graph as parameters.  ...  Table 1 1 Parameterized complexity of graph constraint logic problems.  ... 
arXiv:1509.02683v1 fatcat:wgyz52d3rbcbhmm3n6f6ve3dmq

Parameterized Complexity of Graph Constraint Logic

Tom Van Der Zanden
unpublished
We study the para-meterized complexity of Constraint Graph Satisfiability and both bounded and unbounded versions of Nondeterministic Constraint Logic (NCL) with respect to solution length, treewidth and  ...  maximum degree of the underlying constraint graph as parameters.  ...  Table 1 1 Parameterized complexity of graph constraint logic problems. Problem CGS C2E C2C bC2E bC2C I P E C ' 1 5  ... 
fatcat:atvcl4qagnfhzlx345yvjyfgfa

Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems

G. Gottlob, S. Szeider
2007 Computer journal  
We survey the parameterized complexity of problems that arise in artificial intelligence, database theory, and automated reasoning.  ...  Furthermore, we survey parameterized algorithms for problems arising in the context of the stable model semantics of logic programs, for a number of other problems of non-monotonic reasoning, and for the  ...  Acknowledgment We thank Mike Fellows for valuable comments on a preliminary version of the paper and Marko Samer for careful proof reading.  ... 
doi:10.1093/comjnl/bxm056 fatcat:okmgxlprfjfdtl5sienm6b5vdu

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301)

Andrei A. Bulatov, Venkatesan Guruswami, Andrei Krokhin, Dániel Marx, Marc Herbstritt
2016 Dagstuhl Reports  
During the past two decades, an impressive array of diverse methods from several different mathematical fields, including algebra, logic, mathematical programming, probability theory, graph theory, and  ...  The Dagstuhl Seminar 15301 "The Constraint Satisfaction Problem: Complexity and Approximability" was aimed at bringing together researchers using all the different techniques in the study of the CSP, so  ...  In particular, many of the success stories of parameterized complexity, and many of its still open problems, can be phrased as questions about the parameterized complexity properties (in particular, FPT  ... 
doi:10.4230/dagrep.5.7.22 dblp:journals/dagstuhl-reports/BulatovGKM15 fatcat:lcyvfsxsbzbrfe27irlpxepxoi

Checking Polynomial Time Complexity with Types [chapter]

Patrick Baillot
2002 Foundations of Information Technology in the Era of Network and Mobile Computing  
We consider parameterized types where parameters are on the number of modalities and the type instantiation problem: given a term and a parameterized type, does there exist a valuation of the parameters  ...  Light Affine Logic (LAL) is a logical system due to Girard and Asperti offering a polynomial time cut-elimination procedure.  ...  So we end up with a finite number of possible parameterized graph terms and associated constraints.  ... 
doi:10.1007/978-0-387-35608-2_31 dblp:conf/ifipTCS/Baillot02 fatcat:7x4rxh4mb5agzdpfxryxtipkg4

Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning [chapter]

Georg Gottlob, Francesco Scarcello, Martha Sideri
1999 Lecture Notes in Computer Science  
We study the parameterized complexity of various problems in AI and nonmonotonic reasoning. We show that a number of relevant parameterized problems in these areas are fixed-parameter tractable.  ...  Among these problems are constraint satisfaction problems with bounded treewidth and fixed domain, restricted forms of conjunctive database queries, restricted satisfiability problems, propositional logic  ...  Part of the work of Francesco Scarcello has been carried out while visiting the Technische Universität Wien.  ... 
doi:10.1007/3-540-46767-x_1 fatcat:tui4rdaidrh6rjcvi6ybqaibgq

Fixed-parameter complexity in AI and nonmonotonic reasoning

Georg Gottlob, Francesco Scarcello, Martha Sideri
2002 Artificial Intelligence  
We study the parameterized complexity of various problems in AI and nonmonotonic reasoning. We show that a number of relevant parameterized problems in these areas are fixed-parameter tractable.  ...  Among these problems are constraint satisfaction problems with bounded treewidth and fixed domain, restricted forms of conjunctive database queries, restricted satisfiability problems, propositional logic  ...  Part of the work of Francesco Scarcello has been carried out while visiting the Technische Universität Wien.  ... 
doi:10.1016/s0004-3702(02)00182-0 fatcat:vrfcg23nyjettjkvt2y3nne4ky

Counting Answers to Existential Questions

Holger Dell, Marc Roth, Philip Wellnitz, Michael Wagner
2019 International Colloquium on Automata, Languages and Programming  
language of parameterized complexity, this essentially establishes a #A[2]-completeness result.  ...  constraints over the free variables.  ...  However, the parameterized complexity of finding a subgraph in G that is isomorphic to a small pattern graph P is a long-standing open question in parameterized complexity [11, Chapt. 33.1] .  ... 
doi:10.4230/lipics.icalp.2019.113 dblp:conf/icalp/DellRW19 fatcat:xfnlsag2bbefvnavyok634g46e

A Compendium of Parameterized Problems at Higher Levels of the Polynomial Hierarchy

Ronald de Haan, Stefan Szeider
2019 Algorithms  
These problems are parameterized versions of problems whose complexity lies at the second level of the Polynomial Hierarchy or higher.  ...  We present a list of parameterized problems together with a complexity classification of whether they allow a fixed-parameter tractable reduction to SAT or not.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/a12090188 fatcat:merbxfa4wjfbpcyes4lp6waf5i

Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity

Dušan Knop, Martin Koutecký, Tomáš Masařík, Tomáš Toufar
2018 Logical Methods in Computer Science  
This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded  ...  Second, we study the parameterized complexity of the associated model checking problem for various combinations of these MSO extensions.  ...  Parameterized Complexity. Let Σ be a finite alphabet. A parameterized language is a language P ⊆ Σ * × N.  ... 
doi:10.23638/lmcs-15(4:12)2019 fatcat:fxnt42due5gu3ew6jeh36h4vku

Page 8154 of Mathematical Reviews Vol. , Issue 2004j [page]

2004 Mathematical Reviews  
Jonsson, The complexity of constraints on intervals and lengths (443-454); Denis Thérien and Thomas Wilke, Nesting until and since in linear temporal logic (455—464); Till Tantau, Comparing verboseness  ...  (112-120); Johannes K6bler and Ja- cobo Toran, The complexity of graph isomorphism for colored graphs with color classes of size 2 and 3 (121-132); E. Boros [En- dre Boros], V. Gurvich, L.  ... 

Parameterized complexity results for 1-safe Petri nets [article]

M. Praveen, Kamal Lodaya
2011 arXiv   pre-print
We associate a graph with a 1-safe Petri net and study the parameterized complexity of various problems with parameters derived from the graph.  ...  As a corollary, this proves a conjecture of Downey et. al. about the hardness of some graph pebbling problems.  ...  Parameters The study of parameterized complexity derived an initial motivation from the study of graph parameters.  ... 
arXiv:1106.2122v1 fatcat:qaasqm5bi5hmveksfv4efpvdhm

Bio-ModelChecker: Using Bounded Constraint Satisfaction to Seamlessly Integrate Observed Behavior With Prior Knowledge of Biological Networks

Hooman Sedghamiz, Matthew Morris, Travis J. A Craddock, Darrell Whitley, Gordon Broderick
2019 Frontiers in Bioengineering and Biotechnology  
In this paper, we propose a bounded Constraint Satisfaction (CS) based model checking framework for parameter set identification that readily accommodates partial records and the exponential complexity  ...  The in silico study and reverse engineering of regulatory networks has gained in recognition as an insightful tool for the qualitative study of biological mechanisms that underlie a broad range of complex  ...  It then ranks models satisfying these constraints based on their goodness-of-fit and complexity which in this discrete logic framework are denoted as path-length, robustness, number of interactions, and  ... 
doi:10.3389/fbioe.2019.00048 pmid:30972331 pmcid:PMC6443719 fatcat:56q5hw3x7fhvlbzehfvxnthnei

Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation

Christophe Paul, Michał Pilipczuk
2020 Algorithmica  
In "Parameterized Complexity of Independent Set in H-Free Graphs", É. Bonnet, N. Bousquet, P. Charbit, S. Thomassé and R.  ...  Magnusson presents a parameterized complexity analysis of basic problems belonging to such as computing the diameter, the radius or the Wiener index of a graph.  ... 
doi:10.1007/s00453-020-00748-w fatcat:hfsrwsujjza3nhixojdyev73wy
« Previous Showing results 1 — 15 out of 21,541 results