Efficient BDD encodings for partial order constraints with application to expert systems in software verification

Authors:
Masahito Kurihara;Hisashi Kondo
Affiliations:
Hokkaido University, Sapporo, Japan;Ibaraki University, Hitachi, Japan
Venue:
IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
Year:
2004

Citing 0
Cited 13

Constraints for Argument Filterings

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Proving Termination Using Recursive Path Orders and SAT Solving

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Increasing Interpretations

Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Proving Termination with (Boolean) Satisfaction

Logic-Based Program Synthesis and Transformation
KBO Orientability

Journal of Automated Reasoning
Transforming SAT into Termination of Rewriting

Electronic Notes in Theoretical Computer Science (ENTCS)
Increasing interpretations

Annals of Mathematics and Artificial Intelligence
Satisfying KBO constraints

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Enforcing confidentiality and data visibility constraints: an OBDD approach

DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
SAT solving for argument filterings

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Solving partial order constraints for LPO termination

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Journal of Automated Reasoning
An OBDD approach to enforce confidentiality and visibility constraints in data publishing

Journal of Computer Security - DBSec 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a class of computational problems called the partial order constraint satisfaction problems (POCSPs) and present three methods for encoding them as binary decision diagrams (BDDs). The first method, which simply augments domain constraints with the transitivity and asymmetry for partial orders, is improved by the second method, which introduces the notion of domain variables to reduce the number of Boolean variables. The third method turns out to be most useful for monotonic domain constraints, because it requires no explicit encoding for the transitivity. We show how those methods are successfully applied to expert systems in a software verification domain.