Switch to: References

Add citations

You must login to add citations.
  1. No Rationality Through Brute-Force.Danilo Fraga Dantas - 2017 - Filosofia Unisinos 18 (3):195-200.
    All reasoners described in the most widespread models of a rational reasoner exhibit logical omniscience, which is impossible for finite reasoners (real reasoners). The most common strategy for dealing with the problem of logical omniscience is to interpret the models using a notion of beliefs different from explicit beliefs. For example, the models could be interpreted as describing the beliefs that the reasoner would hold if the reasoner were able reason indefinitely (stable beliefs). Then the models would describe maximum rationality, (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The decision problem for formulas in prenex conjunctive normal form with binary disjunctions.M. R. Krom - 1970 - Journal of Symbolic Logic 35 (2):210-216.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Conservative reduction classes of Krom formulas.Stål O. Aanderaa, Egon Börger & Harry R. Lewis - 1982 - Journal of Symbolic Logic 47 (1):110-130.
    A Krom formula of pure quantification theory is a formula in conjunctive normal form such that each conjunct is a disjunction of at most two atomic formulas or negations of atomic formulas. Every class of Krom formulas that is determined by the form of their quantifier prefixes and which is known to have an unsolvable decision problem for satisfiability is here shown to be a conservative reduction class. Therefore both the general satisfiability problem, and the problem of satisfiability in finite (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Prefix classes of Krom formulas.Stål O. Aanderaa & Harry R. Lewis - 1973 - Journal of Symbolic Logic 38 (4):628-642.
    Download  
     
    Export citation  
     
    Bookmark  
  • The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • How we designed winning algorithms for abstract argumentation and which insight we attained.Federico Cerutti, Massimiliano Giacomin & Mauro Vallati - 2019 - Artificial Intelligence 276 (C):1-40.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Guarantees and limits of preprocessing in constraint satisfaction and reasoning.Serge Gaspers & Stefan Szeider - 2014 - Artificial Intelligence 216 (C):1-19.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Complete rings of sets and sentential logic.Melven R. Krom - 1977 - Studia Logica 36 (3):173 - 175.
    Download  
     
    Export citation  
     
    Bookmark  
  • Tractability-preserving transformations of global cost functions.David Allouche, Christian Bessiere, Patrice Boizumault, Simon de Givry, Patricia Gutierrez, Jimmy H. M. Lee, Ka Lun Leung, Samir Loudni, Jean-Philippe Métivier, Thomas Schiex & Yi Wu - 2016 - Artificial Intelligence 238 (C):166-189.
    Download  
     
    Export citation  
     
    Bookmark