Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Show simple item record

dc.date.accessioned 2012-07-19T13:13:45Z
dc.date.available 2012-07-19T13:13:45Z
dc.date.issued 2011
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/18791
dc.description.abstract We present an approach to propositional satisfiability as a Finite State Automata automata construction problem. From a theoretical point of view it has consequences for languages beyond context free power. There are no consequences on complexity issues due to Automata construction (using intersection) is PSPACE-complete. From a practical point of view it was shown that this approach is competitive with ALL-SAT approaches and even with state of the art SAT solvers on traditional hard problems. Here, we show that techniques used in DPLL can be used in an automata approach. This kind of approach opens a new path of research on propositional satisfiability. en
dc.format.extent 1344-1353 es
dc.language en es
dc.subject ALL-SAT; model counting; FSA intersection; regular expression compilation; Non-clausal formula; clause learning en
dc.title Propositional Satisfiability (SAT) as a language problem en
dc.type Objeto de conferencia es
sedici.creator.person Castaño, Rodrigo es
sedici.creator.person Castaño, José M. es
sedici.description.note Presentado en el II Workshop Aspectos Teóricos de Ciencia de la Computación (WATCC) es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Red de Universidades con Carreras en Informática (RedUNCI) es
sedici.subtype Objeto de conferencia es
sedici.rights.license Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
sedici.rights.uri http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
sedici.date.exposure 2011-10
sedici.relation.event XVII Congreso Argentino de Ciencias de la Computación es
sedici.description.peerReview peer-review es


Download Files

This item appears in the following Collection(s)

Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)