Login / Signup

Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems.

Philippe BesnardTorsten SchaubHans TompitsStefan Woltran
Published in: JELIA (2002)
Keyphrases
  • quantified boolean formulas
  • decision procedures
  • search algorithm
  • computational complexity
  • tabu search
  • belief revision