Cause-effect relationships and partially defined Boolean functions

[en] This paper investigates the use of Boolean techniques in a systematic study of cause-effect relationships. The model uses partially defined Boolean functions. Procedures are provided to extrapolate from limited observations, concise and meaningful theories to explain the effect under study, and to prevent (or provoke) its occurrence

Disciplines :

Computer science
Mathematics
Quantitative methods in economics & management

Author, co-author :

Crama, Yves ; Université de Liège - ULiège > HEC-Ecole de gestion : UER > Recherche opérationnelle et gestion de la production

Ibaraki, Toshihide

Language :

English

Title :

Cause-effect relationships and partially defined Boolean functions

Publication date :

1988

Journal title :

Annals of Operations Research

ISSN :

0254-5330

eISSN :

1572-9338

Publisher :

Springer, Norwell, United States - Massachusetts

Volume :

Pages :

299-326

Peer reviewed :

Peer Reviewed verified by ORBi

Available on ORBi :

since 15 January 2013

Statistics

Number of views

79 (5 by ULiège)

Number of downloads

2093 (5 by ULiège)

More statistics

Scopus citations^®

215

Scopus citations^®
without self-citations

150

OpenCitations

161

OpenAlex citations

240

publications

supporting

mentioning

contrasting

Smart Citations

Citing PublicationsSupportingMentioningContrasting

View Citations

See how this article has been cited at scite.ai

scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.

Bibliography

Cohen P.R., Feigenbaum E.A. The Handbook of Artificial Intelligence, Vol. III, P.R., Cohen, E.A., Feigenbaum, W. Kaufmann, Inc., Los Altos; 1982.
Cutler R.B., Muroga S. (1980) Useless prime implicants of incompletely specified multiple-output switching functions. International Journal of Computer and Information Sciences 4:337-350.
Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman and Co., San Francisco; 1979.
Juravliov (1958) On the separability of subsets of vertices of the n-dimensional unit cube, Trudy Matematičeskovo Instituta Imeni V.A. Steklova 51:143-157.
Lapscher F. (1967) Fonctions Booléennes très incomplètes: représentation par des sommes de monômes. Revue d'Informatique et de Recherche Opérationnelle 4:73-88.
Mendelson E. Theory and Problems of Boolean Algebra and Switching Circuits, Schaum's Outline Series, McGraw-Hill, New York; 1970.
Muroga S. Logic Design and Switching Theory, Wiley, New York; 1979.
Necula N.N. (1972) O metodĂ pentru reducerea numĂrului de variabile al functiilor Booleene foarte slab definite. Studii Cercetari Matematice 24:561-566.
Valiant L.G. (1984) A theory of the learnable. Communications of the ACM 27:1134-1142.
Zuev (1979) Approximation of a partial Boolean function by a monotonic Boolean function. U.S.S.R. Computational Mathematics and Mathematical Physics 18:212-218.

Similar publications

Sorry the service is unavailable at the moment. Please try again later.

Name	Provider / Domaine	Expiration	Description
JSESSIONID	Oracle Corporation www.uliege.be	Session	General purpose platform session cookie, used by sites written in JSP. Usually used to maintain an anonymous user session by the server.
CookieScriptConsent	CookieScript .uliege.be	1 year	This cookie is used by Cookie-Script.com service to remember visitor cookie consent preferences. It is necessary for Cookie-Script.com cookie banner to work properly.

Name	Provider / Domaine	Expiration	Description
_pk_id	InnoCraft Ltd .uliege.be	1 year	Used to store a few details about the user such as the unique visitor ID
_pk_ses	InnoCraft Ltd .uliege.be	30 minutes	Short lived cookies used to temporarily store data for the visit
_pk_ref	InnoCraft Ltd .uliege.be	6 months	Used to store the attribution information, the referrer initially used to visit the website