Pages that link to "Item:Q1801319"
From MaRDI portal
The following pages link to Foundations of equational logic programming (Q1801319):
Displaying 45 items.
- An integrated framework for the diagnosis and correction of rule-based programs (Q604477) (← links)
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Lazy narrowing: strong completeness and eager variable elimination (Q671677) (← links)
- Programming in equational logic: Beyond strong sequentiality (Q689097) (← links)
- Equality and abductive residua for Horn clauses (Q689280) (← links)
- A rationale for conditional equational programming (Q915429) (← links)
- Conditional equational theories and complete sets of transformations (Q918541) (← links)
- A new deductive approach to planning (Q922685) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Termination of narrowing revisited (Q1035697) (← links)
- Conditional narrowing modulo a set of equations (Q1261194) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- Completeness results for basic narrowing (Q1328184) (← links)
- Oriented equational logic programming is complete (Q1355756) (← links)
- Incremental constraint satisfaction for equational logic programming (Q1367535) (← links)
- Translation of logic programs into functional fixpoint equations (Q1823723) (← links)
- Horn equational theories and paramodulation (Q1824409) (← links)
- Default reasoning by deductive planning (Q1896366) (← links)
- Linear and unit-resulting refutations for Horn theories (Q1923821) (← links)
- A semantic framework for open processes (Q2463561) (← links)
- General \(E\)-unification with eager variable elimination and a nice cycle rule (Q2642468) (← links)
- Declarative debugging of functional logic programs (Q2841221) (← links)
- A debugging scheme for functional logic programs (Q2841284) (← links)
- Combining Logic Programming and Equation Solving (Q3348390) (← links)
- A Finite Representation of the Narrowing Space (Q3453648) (← links)
- (Q3490963) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- (Q3821636) (← links)
- (Q4362899) (← links)
- Functional Logic Programming: From Theory to Curry (Q4916076) (← links)
- Detecting redundant narrowing derivations by the LSE-SL reducibility test (Q5055750) (← links)
- On narrowing, refutation proofs and constraints (Q5055818) (← links)
- Regular substitution sets: A means of controlling E-unification (Q5055844) (← links)
- Higher order conditional rewriting and narrowing (Q5096313) (← links)
- An introduction to category-based equational logic (Q5096381) (← links)
- Lazy narrowing: Strong completeness and eager variable elimination (extended abstract) (Q5096745) (← links)
- Functional Logic Programming in Maude (Q5403075) (← links)
- Termination of Narrowing in Left-Linear Constructor Systems (Q5458432) (← links)
- Quantified Equilibrium Logic and Foundations for Answer Set Programs (Q5504679) (← links)
- Termination by absence of infinite chains of dependency pairs (Q5878910) (← links)
- An optimal narrowing strategy for general canonical systems (Q5881212) (← links)
- Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation (Q5881277) (← links)
- Constrained equational deduction (Q5881303) (← links)
- Cartesian closed categories of domains and the space proj(D) (Q6116575) (← links)
- On the specification of visual languages: multisets as first-class citizens (Q6560194) (← links)
