Backdoors to tractable answer set programming (Q2341833): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(10 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Gringo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: clasp / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Clingo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: iClingo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SageMath / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: NuMVC / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Python / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2014.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2180068027 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5398060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation by default and unstratifiable logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2005: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Set in Mixed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of propositional closed world reasoning and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with edge weighting and configuration checking heuristics for minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn clause queries and generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for the directed feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid branch-and-bound approach for exact rational mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoffs in the Complexity of Backdoor Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational properties of argument systems satisfying graph-theoretic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting tractable fragments of abstract argumentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational cost of disjunctive logic programming: Propositional case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to Normality for Disjunctive Logic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Good, the Bad, and the Odd: Cycles in Answer-Set Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to Acyclic SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoors to Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Backdoors to Nested Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarantees and limits of preprocessing in constraint satisfaction and reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting inconsistencies in large biological networks with answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2909134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex optimization in answer set programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3011296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-driven answer set solving: from theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5282991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negation as failure using tight derivations for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer set programming based on propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity in AI and nonmonotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded treewidth as a key to tractability of knowledge representation and reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfolding partiality and disjunctions in stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Stable Models via Reductions to Difference Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction-Based Algorithm for 2QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of restricted branching in clause learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of structural branching on the efficiency of clause learning SAT solving: An experimental study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming normal logic programs to constraint logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empirical Study of the Anatomy of Modern Sat Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The even-path problem for graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The DLV system for knowledge representation and reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programming and nonmonotonic reasoning. 8th international conference, LPNMR 2005, Diamante, Italy, September 5--8, 2005. Proceedings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: ASSAT: computing answer sets of a logic program by SAT solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Even Cycle Transversal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of feedback set problems in signed digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5398063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic-Programming Based ASP-Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the impact of stratification on the complexity of nonmonotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programs with stable model semantics as a constraint programming paradigm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving \#SAT using vertex covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Belief Revision with Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost 2-SAT is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Team-building with answer set programming in the Gioia-Tauro seaport / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permanents, Pfaffian orientations, and even directed circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoor sets of quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-transformable combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4221106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending and implementing the stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3181640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer Set Programming for Single-Player Games in General Game Playing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3793731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank

Latest revision as of 02:01, 10 July 2024

scientific article
Language Label Description Also known as
English
Backdoors to tractable answer set programming
scientific article

    Statements

    Backdoors to tractable answer set programming (English)
    0 references
    0 references
    0 references
    6 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    answer set programming
    0 references
    backdoors
    0 references
    computational complexity
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references