z-logo
HomeZAIABlog
open-access-imgOpen Access
Clause Elimination for SAT and QSAT
Author(s) -
Marijn J. H. Heule,
Matti J„ärvisalo,
Florian Lonsing,
Martina Seidl,
Armin Biere
Publication year - 2015
Publication title -
journal of artificial intelligence research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.79
H-Index - 123
eISSN - 1943-5037
pISSN - 1076-9757
DOI - 10.1613/jair.4694
Subject(s) - computer science , boolean satisfiability problem , conjunctive normal form , satisfiability , true quantified boolean formula , programming language , theoretical computer science , equivalence (formal languages) , mathematics , discrete mathematics
The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become central declarative progra...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

AboutCareersPublisher PartnersContact UsGet Organisational Trial or Quote

Learn

FAQsBlogTerms of UsePrivacy Policy

Download the Zendy App

Get it on
Google Play
Download on the
App Store

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.