Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("WOS L")

Publication Year[py]

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

Discipline (document) [di]

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

Results 1 to 12 of 12

  • Page / 1

Export

Selection :

  • and

SOLVING OPEN QUESTIONS WITH AN AUTOMATED THEOREM-PROVING PROGRAMWOS L.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 1-31; BIBL. 26 REF.Conference Paper

The resonance strategyWOS, L.Computers & mathematics with applications (1987). 1995, Vol 29, Num 2, pp 133-178, issn 0898-1221Article

PROCEDURE IMPLEMENTATION THROUGH DEMODULATION AND RELATED TRICKSWINKER SK; WOS L.1982; LECTURE NOTES IN COMPUTER SCIENCE; ISSN 0302-9743; DEU; DA. 1982; VOL. 138; PP. 109-131; BIBL. 26 REF.Conference Paper

COMPLEXITY AND RELATED ENHANCEMENTS FOR AUTOMATED THEOREMPROVING PROGRAMS.OVERBEEK R; MCCHAREN J; WOS L et al.1976; COMPUTERS MATH. APPL.; G.B.; DA. 1976; VOL. 2; NO 1; PP. 1-16; BIBL. 4 REF.Article

HYPERPARAMODULATION: A REFINEMENT OF PARAMODULATIONWOS L; OVERBEEK R; HENSCHEN L et al.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 87; PP. 208-219; BIBL. 7 REF.Conference Paper

SEMIGROUPS, ANTIAUTOMORPHISMS, AND INVOLUTIONS: A COMPUTER SOLUTION TO AN OPEN PROBLEM. IWINKER SK; WOS L; LUSK EL et al.1981; MATH. COMPUT.; ISSN 0025-5718; USA; DA. 1981; VOL. 37; NO 156; PP. 533-545; BIBL. 6 REF.Article

A THEOREM-PROVING LANGUAGE FOR EXPERIMENTATION.HENSCHEN L; OVERBEEK R; WOS L et al.1974; COMMUNIC. A.C.M.; U.S.A.; DA. 1974; VOL. 17; NO 6; PP. 308-314; BIBL. 6 REF.Article

Automated theorem proving and logic programming : a natural symbiosisWOS, L; MCCUNE, W.The Journal of logic programming. 1991, Vol 11, Num 1, pp 1-53, issn 0743-1066, 53 p.Article

The absence and the presence of fixed point combinatorsMCCUNE, W; WOS, L.Theoretical computer science. 1991, Vol 87, Num 1, pp 221-228, issn 0304-3975Article

Automating the search for answers to open questionsWOS, L; FITELSON, B.Lecture notes in computer science. 2000, pp 519-525, issn 0302-9743, isbn 3-540-67863-8Conference Paper

Appendix : Conjectures concerning proof, design, and verificationWOS, L.Lecture notes in computer science. 2000, pp 526-533, issn 0302-9743, isbn 3-540-67863-8Conference Paper

A new use of an automated reasoning assistant: Open questions in equivalential calculus and the study of infinite domainsWOS, L; WINKER, S; SMITH, B et al.Artificial intelligence. 1984, Vol 22, Num 3, pp 303-356, issn 0004-3702Article

  • Page / 1