SciELO - Scientific Electronic Library Online

 
vol.17 issue4On the NP-Completeness of Computing the Commonality Among the Objects Upon Which a Collection of Agents Has Performed an ActionA New Measure of Circularity Based on Distribution of the Radius author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

Print version ISSN 1405-5546

Abstract

GUILLEN, Carlos; LEMUZ, Rafael  and  AYAQUICA, Irene. Model Counting in the 2μ -3MON Syntactic Class. Comp. y Sist. [online]. 2013, vol.17, n.4, pp.501-513. ISSN 1405-5546.

The counting model problem in Boolean formulas is #P-complete, i.e., there is no known deterministic algorithm in the classical computability model (Turing machine) that makes this count in polynomial time. The difficulty persists even imposing more restrictive conditions on the syntactic classes of Boolean formulas. In this paper we present a treatable family within the syntactical class 2μ-3MON. The identification of this family is done by using the hypergraph associated with simple structures such as chains and cycles. Then, matrix operators acting over these structures are identified; these operators lead to efficient algorithms that perform the model counting on the identified family in linear time for the number of clauses in the instantiated formula; unlike hypergraphic invariant based methods (such as tree width), which perform the count in cubic time.

Keywords : #SAT; syntactic class; hypergraph.

        · abstract in Spanish     · text in Spanish     · Spanish ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License