SAT solving by CSFLOC, the next generation of full-length clause counting algorithms

Kusper, Gábor; Bíró, Csaba; Iszaly, Gyorgy Barna

doi:10.1109/fiot.2018.8325589

Cited by 5 publications

(8 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By studying Optimized CCC, we observed that its full-length clause counter can be increased on its last 1 bit in the best case. We proved that this observation is generally true for Optimized CCC [205].…”

Section: The Csflocsupporting

confidence: 65%

See 1 more Smart Citation

Formal Methods for Modelling Wireless Sensor Networks

Bíró¹

2019

View full text Add to dashboard Cite

Budapest 2019• Optimization Modulo Theories (OMT ) is an extension of SMT with objective functions to maximize or minimize. An OMT problem, therefore, contains not only a formula to satisfy, but also an expression max : obj or min : obj, where obj denotes the objective function. Objectives and ThesesThis section summarizes the major contributions and the impact of the work by the author.According to the traditions of PhD dissertations the editorial "we" is used for describing the details of main results. ObjectivesO. I We used zeroth-order logic which gives a limited set of tools to examine this field of application:• We have examined whether we can create a SAT -based representation to describe a randomly deployed wireless sensor network consisting of heterogeneous nodes.• We have also examined whether SAT solvers can effectively solve this representation and if so what kind of solver should be used including sequential and also parallel solving methods.O. II We used first-order logic which gives a richer set of tools to examine this field of application:• We have examined whether we can create an SMT based representation of a randomly deployed wireless sensor network consisting of heterogeneous nodes that takes into account physical parameters of a real-world sensor enabling network lifetime investigation.

show abstract

Section: The Csflocsupporting

confidence: 65%

“…In this section we describe, the CSFLOC algorithm [205], i.e., the Counting Subsumed Full-Length Ordered Clauses algorithm. As its name shows, CSFLOC counts full-length clauses, and the clauses are ordered, which means that we use a fixed order of boolean variables, which are presented in the input problem.…”

Section: The Csflocmentioning

confidence: 99%

Formal Methods for Modelling Wireless Sensor Networks

Bíró¹

2019

View full text Add to dashboard Cite

show abstract

“…For the lectures related to Computational Logic we have developed a SAT solver, called CSFLOC [34], and some problem generators which can generate minimal UNSAT problems [33].…”

Section: Sat Solversmentioning

confidence: 99%

“…We developed special tools for SAT (propositional SATisfiability [29]), some based on the original methods from some of the partners. The name of the new SAT solver is CSFLOC, which states for Count Subsumed Full-Length Clauses [34]. This solver is an iterative version of the inclusion-exclusion principle, which is used to solve the #SAT problem (that is the problem of counting the solutions of a SAT instance [6]).…”

Section: Experiments With Automated Reasoning In the Class 1 Introduc...mentioning

confidence: 99%

Experiments with Automated Reasoning in the Class

Dramnesc

Ábrahám

Jebelean

et al. 2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

show abstract

“…In this paper we assume that the communication graph is strongly connected, the cost of communication between each node is constant (we do not use weights), and the network consists of homogeneous nodes. To test the new metrics we used our own representation [7] and SAT solver [10].…”

Section: Preliminariesmentioning

confidence: 99%

Somek-hop based graph metrics and noderanking in wireless sensor networks

Bíró¹,

Kusper²

2019

AMI

View full text Add to dashboard Cite

Node localization and ranking is an essential issue in wireless sensor networks (WSNs). We model WSNs by communication graphs. In our interpretation a communication graph can be directed, in case of heterogeneous sensor nodes, or undirected, in case of homogeneous sensor nodes, and must be strongly connected. There are many metrics to characterize networks, most of them are either global ones or local ones. The local ones consider only the immediate neighbors of the observed nodes. We are not aware of a metric which considers a subgraph, i.e., which is between global and local ones. So our main goal was to construct metrics that interpret the local properties of the nodes in a wider environment. For example, how dense the environment of the given node, or in which extent it can be relieved within its environment. In this article we introduce several novel-hop based density and redundancy metrics: Weighted Communication Graph Density (), Relative Communication Graph Density (ℛ), Weighted Relative Communication Graph Density (ℛ), Communication Graph Redundancy (ℛ), Weighted Communication Graph Redundancy (ℛ). We compare them to known graph metrics, and show that they can be used for node ranking.

show abstract

SAT solving by CSFLOC, the next generation of full-length clause counting algorithms

Cited by 5 publications

References 10 publications

Formal Methods for Modelling Wireless Sensor Networks

Formal Methods for Modelling Wireless Sensor Networks

Experiments with Automated Reasoning in the Class

Somek-hop based graph metrics and noderanking in wireless sensor networks

Contact Info

Product

Resources

About