NDLI: AND/OR reasoning graphs for determining prime implicants in multi-level combinational networks

Content Provider	IEEE Xplore Digital Library
Author	Stoffel, D. Kunz, W. Gerber, S.
Copyright Year	1996
Description	Author affiliation: Potsdam Univ., Germany (Stoffel, D.)
Abstract	This paper presents a technique to determine prime implicants in multi-level combinational networks. The method is based on a graph representation of Boolean functions called AND/OR reasoning graphs. This representation follows from a search strategy to solve the satisfiability problem that is radically different from conventional search for this purpose (such as exhaustive simulation, backtracking, BDDs). The paper shows how to build AND/OR reasoning graphs for arbitrary combinational circuits and proves basic theoretical properties of the graphs. It will be demonstrated that AND/OR reasoning graphs allow us to naturally extend basic notions of two-level switching circuit theory to multi-level circuits. In particular, the notions of prime implicants and permissible prime implicants are defined for multi-level circuits and it is proved that AND/OR reasoning graphs represent all these implicants. Experimental results are shown for PLA factorization.
Starting Page	529
Ending Page	538
File Size	1083256
Page Count	10
File Format	PDF
ISBN	0780336623
DOI	10.1109/ASPDAC.1997.600326
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1997-01-28
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Intelligent networks Boolean functions Data structures Tree graphs Decision trees Circuit simulation Switching circuits Fault tolerance Computer networks Combinational circuits
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

AND/OR Reasoning Graphs for Determining Prime Implicants in Multi-Level Combinational Networks (1997)

And/or reasoning graphs for determining prime implicants in multi-level combinational networks (1997).

And/or reasoning graphs for determining prime implicants in multi-level combinational networks (1997)

Fault tree analysis: 10/sup 20/ prime implicants and beyond

Synthesis of combinational circuits with special fault-handling capabilities

Reliability evaluation of combinational logic circuits by symbolic simulation

Fault Trees, Prime Implicants, and Noncoherence

Speeding up power estimation by topological analysis

Efficient power analysis of combinational circuits

AND/OR reasoning graphs for determining prime implicants in multi-level combinational networks

Similar Documents

AND/OR Reasoning Graphs for Determining Prime Implicants in Multi-Level Combinational Networks (1997)

And/or reasoning graphs for determining prime implicants in multi-level combinational networks (1997).

And/or reasoning graphs for determining prime implicants in multi-level combinational networks (1997)

Fault tree analysis: 10/sup 20/ prime implicants and beyond

Synthesis of combinational circuits with special fault-handling capabilities

Reliability evaluation of combinational logic circuits by symbolic simulation

Fault Trees, Prime Implicants, and Noncoherence

Speeding up power estimation by topological analysis

Efficient power analysis of combinational circuits

AND/OR reasoning graphs for determining prime implicants in multi-level combinational networks