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