Computing minimal models by partial instantiation (Q672131): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Mixed integer programming methods for computing nonmonotonic deductive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Horn sets in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Specialization of Programs by Theorem Proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive \(LP+\) integrity constraints = stable model semantics. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving propositional satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3789064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5600875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relationship between stable, supported, default and autoepistemic semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing circumscriptive databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846259 / rank
 
Normal rank

Latest revision as of 10:15, 27 May 2024

scientific article
Language Label Description Also known as
English
Computing minimal models by partial instantiation
scientific article

    Statements

    Computing minimal models by partial instantiation (English)
    0 references
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    minimal models of logic programs
    0 references
    computation of structures
    0 references
    disjunctive logic program
    0 references
    grounding
    0 references

    Identifiers