scientific article; zbMATH DE number 599028
From MaRDI portal
Publication:4297316
zbMATH Open0793.03002MaRDI QIDQ4297316FDOQ4297316
Authors:
Publication date: 3 July 1994
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 3904558
- 8th international conference on automated deduction, Oxford, England, July 27 -- August 1, 1986. Proceedings
- scientific article; zbMATH DE number 51865
- 7th international conference on automated deduction, Napa, California, USA, May 14-16, 1984. Proceedings
- Automated deduction -- CADE-10. 10th international conference, Kaiserslautern, Germany, July 24--27, 1990. Proceedings
Festschriften (00B30) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Logic programming (68N17) Mechanization of proofs and logical operations (03B35) Combinatory logic and lambda calculus (03B40)
Cited In (90)
- Decidable call-by-need computations in term rewriting
- Title not available (Why is that?)
- A transformation system for deductive database modules with perfect model semantics
- Complete axiomatizations of some quotient term algebras
- Constructor equivalent term rewriting systems
- Improving the efficiency of non-deterministic computations
- Computation theory and logic. (In memory of Dieter Rödding, 1937--1984. On the occasion of the 50th anniversary of his birth)
- Higher-order families
- Extracting models from clause sets saturated under semantic refinements of the resolution rule.
- Naming and identity in epistemic logic. II: A first-order logic for naming
- Anti-patterns for rule-based languages
- Foundations of Refinement Operators for Description Logics
- Constructor equivalent term rewriting systems are strongly sequential: A direct proof
- Unfold/fold transformations for disjunctive logic programs
- A pearl on SAT and SMT solving in Prolog
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
- Type inference with simple subtypes
- Normalization, approximation, and semantics for combinator systems
- Higher-order rewrite systems and their confluence
- Computation with run time skolemisation (N-Prolog part 3)
- Strongly sequential and inductively sequential term rewriting systems
- Abstract data type systems
- First-order automated reasoning with theories: when deduction modulo theory meets practice
- A symbolic decision procedure for cryptographic protocols with time stamps
- An algebraic semantics for structured transition systems and its application to logic programs
- Computer supported mathematics with \(\Omega\)MEGA
- Higher order unification via explicit substitutions
- On the longest perpetual reductions in orthogonal expression reduction systems
- Towards Ontology Evolution in Physics
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Evaluation strategies for functional logic programming
- Semantics and strong sequentiality of priority term rewriting systems
- Specification and proof in membership equational logic
- Induction = I-axiomatization + first-order consistency.
- Sequentiality in orthogonal term rewriting systems
- On First-Order Model-Based Reasoning
- Compiling a functional logic language: \textit{The Fair Scheme}
- Strong and NV-sequentiality of constructor systems
- Unification in free distributive lattices
- Mathematics based on incremental learning -- excluded middle and inductive inference
- Title not available (Why is that?)
- Semi-unification of two terms in Abelian groups
- Logical debugging
- Unification of infinite sets of terms schematized by primal grammars
- Semi-explicit first-class polymorphism for ML.
- Jean van Heijenoort's contributions to proof theory and its history
- Automata-driven efficient subterm unification
- Rules + strategies for transforming lazy functional logic programs
- Lazy rewriting and context-sensitive rewriting
- Title not available (Why is that?)
- A method for simultaneous search for refutations and models by equational constraint solving
- Sequentiality, monadic second-order logic and tree automata.
- A resolution principle for constrained logics
- Optimizing fuzzy logic programs by unfolding, aggregation and folding
- AC-unification race: The system solving approach, implementation and benchmarks
- Martin Davis on computability, computational logic, and mathematical foundations
- Theorem proving modulo
- Origin tracking
- Termination of just/fair computations in term rewriting
- Evaluation strategies for functional logic programming
- Title not available (Why is that?)
- Descendants and origins in term rewriting.
- Development closed critical pairs
- Lazy narrowing: strong completeness and eager variable elimination
- Combination techniques and decision problems for disunification
- A combinatory logic approach to higher-order E-unification
- Categorical rewriting of term-like structures
- Source-tracking unification
- Perpetuality and uniform normalization in orthogonal rewrite systems
- Unification algorithms cannot be combined in polynomial time.
- Bisimilarity in term graph rewriting.
- Larry Wos: visions of automated reasoning
- Set of support, demodulation, paramodulation: a historical perspective
- On solving nominal disunification constraints
- The conflict-free reduction geometry
- Relating conflict-free stable transition and event models via redex families
- Unranked Nominal Unification
- Normalisation for higher-order calculi with explicit substitutions
- A Needed Rewriting Strategy for Data-Structures with Pointers
- Automating Signature Evolution in Logical Theories
- Lower bounds for the lengths of refutations
- Strictly orthogonal left linear rewrite systems and primitive recursion
- Relating graph and term rewriting via Böhm models
- Unification of drags and confluence of drag rewriting
- On Normalisation of Infinitary Combinatory Reduction Systems
- Lazy context cloning for non-deterministic graph rewriting
- Proof-search in type-theoretic languages: An introduction
- A single-significant-digit calculus for semi-automated guesstimation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4297316)
