The power of non-ground rules in Answer Set Programming (Q4593042): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GASP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1608.01856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy Model Expansion by Incremental Grounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for answer set programming with bounded predicate arities and implications / 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: Abduction from logic programs: Semantics and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex optimization in answer set programming / 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: Generalized hypertree decompositions: NP-hardness and tractable variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of single-rule datalog queries. / 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: Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4702577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing of Complex Non-Ground Rules in Answer Set Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: GASP: Answer Set Programming with Lazy Grounding / rank
 
Normal rank

Latest revision as of 17:26, 14 July 2024

scientific article; zbMATH DE number 6804597
Language Label Description Also known as
English
The power of non-ground rules in Answer Set Programming
scientific article; zbMATH DE number 6804597

    Statements

    The power of non-ground rules in Answer Set Programming (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2017
    0 references
    0 references
    answer set programming
    0 references
    rewriting
    0 references
    non-ground rules
    0 references
    rule decomposition
    0 references
    0 references