Logic programming as classical inference (Q898781): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jal.2015.06.003 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Infinitary logic and admissible sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: MOLOG: A system that extends PROLOG with modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Modal Logic of Equilibrium Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interpretation of default logic in minimal temporal epistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model-theoretic analysis of knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kripke-kleene semantics for logic programs* / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alternating fixpoint of logic programs with negation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-founded semantics for general logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4698331 / 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: Unfolding partiality and disjunctions in stable model semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal belief and negation as failure / 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: Autoepistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contextual hypotheses and semantics of logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantical considerations on nonmonotonic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum model semantics for logic programs with negation-as-failure / 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: Strong equivalence made easy: nested expressions and weight constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JAL.2015.06.003 / rank
 
Normal rank

Latest revision as of 07:44, 10 December 2024

scientific article
Language Label Description Also known as
English
Logic programming as classical inference
scientific article

    Statements

    Logic programming as classical inference (English)
    0 references
    18 December 2015
    0 references
    denotational semantics of logic programs
    0 references
    contextual hypotheses
    0 references
    \(\kappa\)-structures and \(\kappa\)-formulas
    0 references
    partial \(\infty\)-interpretations
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers