Switch to: References

Add citations

You must login to add citations.
  1. Optimizing the computation of overriding in DL N.P. A. Bonatti, I. M. Petrova & L. Sauro - 2022 - Artificial Intelligence 311 (C):103764.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • First-order stable model semantics with intensional functions.Michael Bartholomew & Joohyung Lee - 2019 - Artificial Intelligence 273 (C):56-93.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Ordered completion for first-order logic programs on finite structures.Vernon Asuncion, Fangzhen Lin, Yan Zhang & Yi Zhou - 2012 - Artificial Intelligence 177-179 (C):1-24.
  • Ordered completion for logic programs with aggregates.Vernon Asuncion, Yin Chen, Yan Zhang & Yi Zhou - 2015 - Artificial Intelligence 224 (C):72-102.
  • A progression semantics for first-order logic programs.Yi Zhou & Yan Zhang - 2017 - Artificial Intelligence 250 (C):58-79.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • FLP answer set semantics without circular justifications for general logic programs.Yi-Dong Shen, Kewen Wang, Thomas Eiter, Michael Fink, Christoph Redl, Thomas Krennwallner & Jun Deng - 2014 - Artificial Intelligence 213 (C):1-41.
  • Evaluating epistemic negation in answer set programming.Yi-Dong Shen & Thomas Eiter - 2016 - Artificial Intelligence 237 (C):115-135.
  • Determining inference semantics for disjunctive logic programs.Yi-Dong Shen & Thomas Eiter - 2019 - Artificial Intelligence 277 (C):103165.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • John McCarthy's legacy.Leora Morgenstern & Sheila A. McIlraith - 2011 - Artificial Intelligence 175 (1):1-24.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Functional completion.Vladimir Lifschitz & Fangkai Yang - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):121-130.
    Nonmonotonic causal logic is a knowledge representation language designed for describing domains that involve actions and change. The process of literal completion, similar to program completion familiar from the theory of logic programming, can be used to translate some nonmonotonic causal theories into classical logic. Its applicability is restricted, however, to theories that deal with truth-valued fluents, represented by predicate symbols. In this note we introduce functional completion—a more general process that can be applied to causal theories in which fluents (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Relating constraint answer set programming languages and algorithms.Yuliya Lierler - 2014 - Artificial Intelligence 207 (C):1-22.