Expressiveness of Logic Programs under the General Stable Model Semantics (Q5278207): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: ASSAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Cmodels / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W237647712 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.0773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Datalog vs first-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered completion for first-order logic programs on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional semantics for disjunctive logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loop-separable programs and their first-order definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subclasses of binary NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness of stable model semantics for disjunctive logic programs with functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal forms for second-order logic over finite structures, and classification of NP optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable models and circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal quantifiers and time complexity of random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some (in)translatability results for normal logic programs and propositional theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3112629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive characterizations of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming and Nonmonotonic Reasoning / 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: From answer set logic programming to circumscription via logic of GK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first order nonmonotonic extension of constructive logic / 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: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive logic programs with existential quantification in rule heads / rank
 
Normal rank

Latest revision as of 02:34, 14 July 2024

scientific article; zbMATH DE number 6744621
Language Label Description Also known as
English
Expressiveness of Logic Programs under the General Stable Model Semantics
scientific article; zbMATH DE number 6744621

    Statements

    Expressiveness of Logic Programs under the General Stable Model Semantics (English)
    0 references
    0 references
    0 references
    13 July 2017
    0 references
    answer set programming
    0 references
    complexity
    0 references
    expressiveness
    0 references
    nonmonotonic reasoning
    0 references
    second-order logic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers