Semantic minimization of 3-valued propositional formulae

Proceedings-Symposium on Logic in Computer Science

Volumn , Issue , 2002, Pages 40-51

  Reps, Thomas ^a   Loginov, Alexey ^a   Sagiv, Mooly ^b  

^a University of Wisconsin Madison   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTIC MINIMIZATION;

ALGORITHMS; FORMAL LOGIC; PROBLEM SOLVING; SEMANTICS;

COMPUTER SCIENCE;

EID: 0036051122     PISSN: 10436871     EISSN: None     Source Type: Journal    
DOI: 10.1109/LICS.2002.1029816     Document Type: Article

References (24)

1. Partial logic
2. Partial logic
3. Complete removal of redundant computations
4. Efficient implementation of a BDD package
5. Graph-based algorithms for Boolean function manipulation
6. The mathematical foundation of symbolic trajectory evaluation
7. Two-level logic minimization: An overview
8. A new graph based prime computation technique
9. Implicit prime cover computation: An overview
10. Multivalued logics: A uniform approach to inference in artificial intelligence
11. TVLA: A system for implementing static analyses
12. Fast generation of irredundant sum-of-products forms from binary decision diagrams
13. Shared binary decision diagram with attributed edges for efficient boolean function manipulation
14. The problem of simplifying truth functions
15. Parametric shape analysis via 3-valued logic
16. Parametric shape analysis via 3-valued logic
17. A logic-based approach to data flow analysis problems
18. Formal verification by symbolic evaluation of partially-ordered trajectories
19. Singular terms, truth-value gaps, and free logic