Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages1

Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages1

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal on satisfiability, Boolean modeling and computation Boolean modeling and computation, 2006-03, Vol.1 (1), p.61-88
Hauptverfasser: Coste-Marquis, Sylvie, Le Berre, Daniel, Letombe, Florian, Marquis, Pierre
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 88
container_issue 1
container_start_page 61
container_title Journal on satisfiability, Boolean modeling and computation
container_volume 1
creator Coste-Marquis, Sylvie
Le Berre, Daniel
Letombe, Florian
Marquis, Pierre
description
doi_str_mv 10.3233/SAT190003
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_3233_SAT190003</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_3233_SAT190003</sourcerecordid><originalsourceid>FETCH-LOGICAL-c693-8bb29432a59b818dd3c240b4c9dff2be0f14c4566d0fedb237987f878f01f9003</originalsourceid><addsrcrecordid>eNpNkE1LxDAYhIMouK4e_Ae5eqi--WibHHcXV4WCX71KSZtkiaRNSVpw_70rK-JphoEZmAehawK3jDJ2976qiQQAdoIWJC95BgUpT__5c3SR0idAIQWIBfrYhH705stNe_xm0uynhG2I-HVWw-SsMxqvQ_BGDXgbYj97ZfBapUMcBnzsTga_xDCG5CYXBuVxpYbdrHYmkUt0ZpVP5upXl6je3tebx6x6fnjarKqsKyTLRNtSyRlVuWwFEVqzjnJoeSe1tbQ1YAnveF4UGqzRLWWlFKUVpbBA7OEsW6Kb42wXQ0rR2GaMrldx3xBofrA0f1jYN-ymVeU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages1</title><source>EZB-FREE-00999 freely available EZB journals</source><creator>Coste-Marquis, Sylvie ; Le Berre, Daniel ; Letombe, Florian ; Marquis, Pierre</creator><creatorcontrib>Coste-Marquis, Sylvie ; Le Berre, Daniel ; Letombe, Florian ; Marquis, Pierre</creatorcontrib><identifier>ISSN: 1574-0617</identifier><identifier>EISSN: 1574-0617</identifier><identifier>DOI: 10.3233/SAT190003</identifier><language>eng</language><ispartof>Journal on satisfiability, Boolean modeling and computation, 2006-03, Vol.1 (1), p.61-88</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,777,781,27906,27907</link.rule.ids></links><search><creatorcontrib>Coste-Marquis, Sylvie</creatorcontrib><creatorcontrib>Le Berre, Daniel</creatorcontrib><creatorcontrib>Letombe, Florian</creatorcontrib><creatorcontrib>Marquis, Pierre</creatorcontrib><title>Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages1</title><title>Journal on satisfiability, Boolean modeling and computation</title><issn>1574-0617</issn><issn>1574-0617</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNpNkE1LxDAYhIMouK4e_Ae5eqi--WibHHcXV4WCX71KSZtkiaRNSVpw_70rK-JphoEZmAehawK3jDJ2976qiQQAdoIWJC95BgUpT__5c3SR0idAIQWIBfrYhH705stNe_xm0uynhG2I-HVWw-SsMxqvQ_BGDXgbYj97ZfBapUMcBnzsTga_xDCG5CYXBuVxpYbdrHYmkUt0ZpVP5upXl6je3tebx6x6fnjarKqsKyTLRNtSyRlVuWwFEVqzjnJoeSe1tbQ1YAnveF4UGqzRLWWlFKUVpbBA7OEsW6Kb42wXQ0rR2GaMrldx3xBofrA0f1jYN-ymVeU</recordid><startdate>20060301</startdate><enddate>20060301</enddate><creator>Coste-Marquis, Sylvie</creator><creator>Le Berre, Daniel</creator><creator>Letombe, Florian</creator><creator>Marquis, Pierre</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20060301</creationdate><title>Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages1</title><author>Coste-Marquis, Sylvie ; Le Berre, Daniel ; Letombe, Florian ; Marquis, Pierre</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c693-8bb29432a59b818dd3c240b4c9dff2be0f14c4566d0fedb237987f878f01f9003</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Coste-Marquis, Sylvie</creatorcontrib><creatorcontrib>Le Berre, Daniel</creatorcontrib><creatorcontrib>Letombe, Florian</creatorcontrib><creatorcontrib>Marquis, Pierre</creatorcontrib><collection>CrossRef</collection><jtitle>Journal on satisfiability, Boolean modeling and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Coste-Marquis, Sylvie</au><au>Le Berre, Daniel</au><au>Letombe, Florian</au><au>Marquis, Pierre</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages1</atitle><jtitle>Journal on satisfiability, Boolean modeling and computation</jtitle><date>2006-03-01</date><risdate>2006</risdate><volume>1</volume><issue>1</issue><spage>61</spage><epage>88</epage><pages>61-88</pages><issn>1574-0617</issn><eissn>1574-0617</eissn><doi>10.3233/SAT190003</doi><tpages>28</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1574-0617
ispartof Journal on satisfiability, Boolean modeling and computation, 2006-03, Vol.1 (1), p.61-88
issn 1574-0617
1574-0617
language eng
recordid cdi_crossref_primary_10_3233_SAT190003
source EZB-FREE-00999 freely available EZB journals
title Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages1
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T10%3A07%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Complexity%20Results%20for%20Quantified%20Boolean%20Formulae%20Based%20on%20Complete%20Propositional%20Languages1&rft.jtitle=Journal%20on%20satisfiability,%20Boolean%20modeling%20and%20computation&rft.au=Coste-Marquis,%20Sylvie&rft.date=2006-03-01&rft.volume=1&rft.issue=1&rft.spage=61&rft.epage=88&rft.pages=61-88&rft.issn=1574-0617&rft.eissn=1574-0617&rft_id=info:doi/10.3233/SAT190003&rft_dat=%3Ccrossref%3E10_3233_SAT190003%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true