Switch to: References

Add citations

You must login to add citations.
  1. Paracoherent answer set computation.Giovanni Amendola, Carmine Dodaro, Wolfgang Faber & Francesco Ricca - 2021 - Artificial Intelligence 299 (C):103519.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Logical foundations and complexity of 4QL, a query language with unrestricted negation.Jan Maluszyński & Andrzej Szalas - 2011 - Journal of Applied Non-Classical Logics 21 (2):211-232.
    The paper discusses properties of 4QL, a DATALOG⌉⌉-like query language, originally outlined by Maluszyński and Szalas (Maluszyński & Szalas, 2011). 4QL allows one to use rules with negation in heads and bodies of rules. It is based on a simple and intuitive semantics and provides uniform tools for “lightweight” versions of known forms of nonmonotonic reasoning. Negated literals in heads of rules may naturally lead to inconsistencies. On the other hand, rules do not have to attach meaning to some literals. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations