Conditional term rewriting and first-order theorem proving. Conditional Term Rewriting Systems, Journal of Symbolic Computation 14 :6, Proving equality theorems with hyper-linking. Basic paramodulation and superposition. Journal of Computer and System Sciences 42 :2, Journal of Symbolic Computation 11 , Automated deduction with associative commutative operators. Fundamentals of Artificial Intelligence Research, Goal directed strategies for paramodulation. Journal of Automated Reasoning 5 :3, Proof normalization for resolution and paramodulation. Theoretical Computer Science 59 , Journal of Symbolic Computation 3 , A two-level approach to logic plus functional programming integration.
An Introduction to Automated Deduction.
ISBN 13: 9780934613491
Fundamentals of Artificial Intelligence, Theoretical Computer Science 44 , GWAI und 2. A new method for establishing refutational completeness in theorem proving. Equality Reasoning with Equality-paths. GWAI, Artificial Intelligence 25 :3, Deduction with relation matching. On solving the equality problem in theories defined by Horn clauses.
- Terrorism and Development: Using Social and Economic Development Policies to Inhibit a Resurgence of Terrorism: Using Social and Economic Development Policies to Inhibit a Resurgence of Terrorism.
- In Search of History: Historiography in the Ancient World and the Origins of Biblical History?
- Leaving Microsoft to Change the World: An Entrepreneurs Odyssey to Educate the Worlds Children.
- Account Options.
- A Many Sorted Calculus Based on Resolution and Paramodulation : Christoph Walther : .
Gerald E. Artificial Intelligence 18 :2, Acta Informatica 13 :1, Automated Theorem Proving, Artificial Intelligence 7 :4, Rewrite techniques for transitive relations.
Manfred Schmidt-Schauß - Publications
Theorem proving for hierarchic first-order theories. Algebraic and Logic Programming, Comparison of natural deduction and locking resolution implementations. A complete connection calculus with rigid E-unification. Equality and constrained resolution. Special relations in automated deduction. Automata, Languages and Programming, On the completeness of narrowing for E-unification.
A Many Sorted Calculus Based on Resolution and Paramodulation
Knowledge Based Computer Systems, The full text of this article hosted at iucr. If you do not receive an email within 10 minutes, your email address may not be registered, and you may need to create a new Wiley Online Library account. If the address matches an existing account you will receive an email with instructions to retrieve your username.
Tools Request permission Export citation Add to favorites Track citation. Share Give access Share full text access. Share full text access. Please review our Terms and Conditions of Use and check box below to share full-text version of article. Get access to the full version of this article.
Publications of Manfred Schmidt-Schauss
View access options below. You previously purchased this article through ReadCube. Institutional Login. Log in to Wiley Online Library.
Purchase Instant Access. View Preview.
GBA en. Takagi et al.
Kurdahi et al. Mohan et al. Zhou et al.
A hybrid methodology for synthesis of Petri net models for manufacturing systems. Confidence limits for processes with small statistics in several subchannels and with measurement errors. EPB1 en. Fan et al. Digital computer utilizing a plurality of parallel asynchronous arithmetic units. DEB4 en.