Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("THEOREM PROVING")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2683

  • Page / 108
Export

Selection :

  • and

BERNOULLI AND THE PAPER DIRIGIBLE.EDGE RD.1976; AMER. J. PHYS.; U.S.A.; DA. 1976; VOL. 44; NO 8; PP. 780-781; BIBL. 1 REF.Article

A TECHNIQUE FOR ESTABLISHING COMPLETENESS RESULTS IN THEOREM PROVING WITH EQUALITYPETERSON GE.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 1; PP. 82-100; BIBL. 36 REF.Article

SUBSTANTIABLE EVALUATIONS BY ELECTRONIC COMPUTERS AND THEIR APPLICATION TO ONE PROBLEM IN COMBINATORIAL GEOMETRYPANKOV PS; DOLMATOV SL.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 202-203; BIBL. 4 REF.Article

LOGIC MACHINE ARCHITECTURE: KERNEL FUNCTIONSLUSK EL; MCCUNE WW; OVERBEEK RA et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 70-84; BIBL. 8 REF.Conference Paper

ON THE ROLE OF UNIFICATION IN MECHANICAL THEOREM PROVING.SHOSTAK RE.1977; ACTA INFORMAT.; ALLEM.; DA. 1977; VOL. 7; NO 3; PP. 319-323; BIBL. 8 REF.Article

ON A NEW PROOF OF MOSER'S TWIST MAPPING THEOREM.RUSSMANN H.1976; CELEST. MECH.; NETHERL.; DA. 1976; VOL. 14; NO 1; PP. 19-31; BIBL. 4 REF.; (CONF. MATH. METHODS CELESTIAL MECH. 5. PROC.; OBERWOLFACH; 1975)Conference Paper

COMPARISON OF NATURAL DEDUCTION AND LOCKING RESOLUTION IMPLEMENTATIONSGREENBAUM S; NAGASAKA A; O'RORKE P et al.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 159-171; BIBL. 16 REF.Conference Paper

ON PROVING UNIFORM TERMINATION AND RESTRICTED TERMINATION OF REWRITING SYSTEMSGUTTAG JV; KAPUR D; MUSSER DR et al.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 1; PP. 189-214; BIBL. 10 REF.Article

A COMPARATIVE STUDY OF SEVERAL PROOF PROCEDURESBIBEL W.1982; ARTIFICIAL INTELLIGENCE; ISSN 0374-2539; NLD; DA. 1982; VOL. 18; NO 3; PP. 269-293; BIBL. 21 REF.Article

STEREOSCOPIC DEPTH PERCEPTIONCOLLINS SH.1981; PHOTOGRAMM. ENG. REMOTE SENSING; ISSN 0099-1112; USA; DA. 1981; VOL. 47; NO 1; PP. 45-52; BIBL. 19 REF.Article

SUR UNE GENERALISATION DU THEOREME DE POLYABOL'SHAKOV VI.1980; VEST. MOSKOV. UNIV., 1; SUN; DA. 1980; NO 5; PP. 21-24; ABS. ENG; BIBL. 3 REF.Article

SUR QUELQUES PROBLEMES DE LA THEORIE DESCRIPTIVE DES ENSEMBLES ET SUR LA RELATION ENTRE LA CONSTRUCTIVITE ET LA DEFINISSABILITEKANOVEJ VG.1980; DOKL. AKAD. NAUK SSSR; ISSN 0002-3264; SUN; DA. 1980; VOL. 253; NO 4; PP. 800-803; BIBL. 14 REF.Article

RESOLUTION PLANS IN THEOREM PROVINGCHANG CL.1979; IJCAI 79. INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE. 6/1979/TOKYO; USA; S.L.: INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE; DA. 1979; VOL. 1; PP. 143-148; BIBL. 8 REF.Conference Paper

PROVING PROGRAMS INCORRECT.BRAND D.1976; IN: AUTOM. LANG. PROGRAM. INT. COLLOQ. 3; EDINBURGH; 1976; EDINBURGH; UNIV. PRESS; DA. 1976; PP. 201-227; BIBL. 1 P.Conference Paper

AN EVALUATION OF AN IMPLEMENTATION OF QUALIFIED HYPERRESOLUTION.WINKER SK.1976; I.E.E.E. TRANS. COMPUTERS; U.S.A.; DA. 1976; VOL. 25; NO 8; PP. 835-843; BIBL. 8 REF.Article

HYPOTHESES AUTOAPPLICABLES POUR LES PREDICATS DE DEMONTRABILITE STANDARD ET DE ROSSERSTEPANOV VI.1981; USPEHI MAT. NAUK; ISSN 0042-1316; SUN; DA. 1981; VOL. 36; NO 1; PP. 227-228; BIBL. 5 REF.Article

A UNIFICATION ALGORITHM FOR ASSOCIATIVE-COMMUTATIVE FUNCTIONSSTICKEL ME.1981; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1981; VOL. 28; NO 3; PP. 423-434; BIBL. 17 REF.Article

VARIABLE ELIMINATION AND CHAINING IN A RESOLUTION-BASED PROVER FOR INEQUALITIESBLEDSOE WW; HINES LM.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 70-87; BIBL. 11 REF.Conference Paper

WORST CASE EXPONENTIAL LOWER BOUNDS FOR INPUT RESOLUTION WITH PARAMODULATIONSTATMAN R.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 104-110; BIBL. 8 REF.Article

MATRICE DE CORRELATIION DES ELEVATIONS COMPENSEESTRENKOV I.1980; VISSH. GEOD.; BGR; DA. 1980; NO 5; PP. 28-33; ABS. RUS/ENG; BIBL. 1 REF.Article

PROPRIETES DES GRAPHES HYPERPRIMITIFSKHOMENKO NP; VYVROT TM.1978; UKRAIN. MAT. ZH.; S.S.S.R.; DA. 1978; VOL. 30; NO 1; PP. 136-138; BIBL. 4 REF.Article

SYSTEMES D'INDEPENDANCE DE TYPE MATROIDEGRITSAK VV.1982; DOKLADY - AKADEMII NAUK UKRAINSKOJ SSR. SERIYA A: FIZIKO-MATEMATICHESKIE I TEKHNICHESKIE NAUKI; ISSN 0201-8446; UKR; DA. 1982; NO 9; PP. 61-62; ABS. ENG; BIBL. 6 REF.Article

AN EXTENSION TO LINEAR RESOLUTION WITH SELECTION FUNCTIONMINKER J; ZANON G.1982; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 4; PP. 191-194; BIBL. 8 REF.Article

THE LOGICAL STATUS OF THERMODYNAMIC PROOFS OF MATHEMATICAL THEOREMSDEAKIN MAB; TROUP GJ.1981; PHYS. LETT. SECT. A; ISSN 0375-9601; NLD; DA. 1981; VOL. 83; NO 6; PP. 239-240; BIBL. 8 REF.Article

TRANSFORMING MATINGS INTO NATURAL DEDUCTION PROOFSANDREWS PB.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 281-292; BIBL. 9 REF.Conference Paper

  • Page / 108