We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.

The Boolean SATisfiability Problem in Clifford algebra

Budinich, Marco
2019

Abstract

We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.
25-mar-2019
Pubblicato
https://www.sciencedirect.com/science/article/pii/S0304397519301938
File in questo prodotto:
File Dimensione Formato  
tcs11959_2.pdf

non disponibili

Tipologia: Documento in Versione Editoriale
Licenza: Copyright Editore
Dimensione 610.45 kB
Formato Adobe PDF
610.45 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11368/2941686
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? 2
social impact