Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 29 matches
- 1980
- Luigia Carlucci Aiello, Richard W. Weyhrauch:
Using Meta-Theoretic Reasoning to do Algebra. CADE 1980: 1-13 - Peter B. Andrews:
Transforming Matings into Natural Deduction Proofs. CADE 1980: 281-292 - Gábor Belovári, John A. Campbell:
Generating Contours of Integration: An Application of Prolog in Symbolic Computing. CADE 1980: 14-23 - W. W. Bledsoe, Larry M. Hines:
Variable Elimination and Chaining in a Resolution-based Prover for Inequalities. CADE 1980: 70-87 - Maurice Bruynooghe:
Analysis of Dependencies to Improve the Behaviour of Logic Programs. CADE 1980: 293-305 - Alan Bundy, Bob Welham:
Using Meta-Level Inference for Selective Application of Multiple Rewrite Rules in Algebraic Manipulation. CADE 1980: 24-38 - Philip T. Cox, Tomasz Pietrzykowski:
A Complete, Nonredundant Algorithm for Reversed Skolemization. CADE 1980: 374-385 - Roddy W. Erickson, David R. Musser:
The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs. CADE 1980: 220-231 - Alfredo Ferro, Eugenio G. Omodeo, Jacob T. Schwartz:
Decision Procedures for Some Fragments of Set Theory. CADE 1980: 88-96 - Leonard Friedman:
Reasoning by Plausible Inference. CADE 1980: 126-142 - Frederick C. Furtek:
Specification and Verification of Real-Time, Distributed Systems Using the Theory of Constraints. CADE 1980: 110-125 - Paul Y. Gloess:
An Experiment with the Boyer-Moore Theorem Prover: A Proof of the Correctness of a Simple Parser of Expressions. CADE 1980: 154-169 - Paul Y. Gloess, Jean-Pierre H. Laurent:
Adding Dynamic Paramodulation to Rewrite Algorithms. CADE 1980: 195-207 - Chris Goad:
Proofs as Description of Computation. CADE 1980: 39-52 - Joseph A. Goguen:
How to Prove Algebraic Inductive Hypotheses Without Induction. CADE 1980: 356-373 - Gérard D. Guiho, Christian Gresse:
Program Synthesis from Incomplete Specifiactions. CADE 1980: 53-62 - Jean-Marie Hullot:
Canonical Forms and Unification. CADE 1980: 318-334 - Hans-Josef Jeanrond:
Deciding Unique Termination of Permutative Rewriting Systems: Choose Your Term Algebra Carefully. CADE 1980: 335-355 - Laurent Kott:
A System for Proving Equivalences of Recursive Programs. CADE 1980: 63-69 - Jacek Leszczylowski:
An Experiment with "Edinburgh LCF". CADE 1980: 170-181 - Donald W. Loveland, Robert E. Shostak:
Simplifying Interpreted Formulas. CADE 1980: 97-109 - Rob Nederpelt:
An Approach to Theorem Proving on the Basis of a Typed Lambda-Calculus. CADE 1980: 182-194 - Helga Noll:
A Note on Resolution: How to Get Rid of Factoring without Loosing Completeness. CADE 1980: 250-263 - Ross A. Overbeek, Ewing L. Lusk:
Data Structures and Control Architectures for Implementation of Theorem-Proving Programs. CADE 1980: 232-249 - Luís Moniz Pereira, António Porto:
Selective Backtracking for Logic Programs. CADE 1980: 306-317 - David A. Plaisted:
Abstraction Mappings in Mechanical Theorem Proving. CADE 1980: 264-280 - Alan M. Thompson:
Logical Support in a Time-Varying Model. CADE 1980: 143-153 - Larry Wos, Ross A. Overbeek, Lawrence J. Henschen:
Hyperparamodulation: A Refinement of Paramodulation. CADE 1980: 208-219 - Wolfgang Bibel, Robert A. Kowalski:
5th Conference on Automated Deduction, Les Arcs, France, July 8-11, 1980, Proceedings. Lecture Notes in Computer Science 87, Springer 1980, ISBN 3-540-10009-1 [contents]
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-08 18:59 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint