Complexity results for answer set programming with bounded predicate arities and implications (Q2426101): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-008-9086-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157334516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge Representation, Reasoning and Declarative Problem Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning with minimal models: efficient algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for skeptical stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / 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: 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: Expressive power and complexity of partial models for disjunctive deductive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing preferred answer sets by meta-interpretation in Answer Set Programming / 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: Strong order equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Magic Sets and their application to data integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bottom-up computation of perfect models for disjunctive theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinctness as a source of complexity in logical formalisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of acyclic conjunctive queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing only minimal answers in disjunctive deductive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer set programming and plan generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly equivalent logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressibility of stable logic programming / 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: Q3939270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixpoint semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension to linear resolution with selection function / 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: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive powers of the logic programming semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model generation and state generation for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SLT-resolution for the well-founded semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong equivalence made easy: nested expressions and weight constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for goal-driven query processing in disjunctive deductive databases / rank
 
Normal rank

Latest revision as of 21:51, 27 June 2024

scientific article
Language Label Description Also known as
English
Complexity results for answer set programming with bounded predicate arities and implications
scientific article

    Statements

    Complexity results for answer set programming with bounded predicate arities and implications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2008
    0 references
    0 references
    Answer set programming
    0 references
    Computational complexity
    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