Incremental constraint satisfaction for equational logic programming

DOI10.1016/0304-3975(94)00224-7zbMATH Open0884.68032DBLPjournals/tcs/AlpuenteFL95OpenAlexW1985929555WikidataQ57978312 ScholiaQ57978312MaRDI QIDQ1367535FDOQ1367535

María Alpuente, M. Falaschi, Giorgio Levi

Publication date: 29 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00224-7

Recommendations

• scientific article
• An equational approach to logic programming
• Efficient program synthesis using constraint satisfaction in inductive logic programming
• scientific article; zbMATH DE number 2209387
• Efficient interval linear equality solving in constraint logic programming
• Optimized algorithms for incremental analysis of logic programs
• Constraint satisfaction using constraint logic programming
• Induction of Constraint Logic Programs
• Foundations of equational logic programming

zbMATH Keywords

constraint logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Logic programming with functions and predicates: The language Babel
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Conditional rewrite rules
• Conditional rewrite rules: Confluence and termination
• A rationale for conditional equational programming
• Title not available (Why is that?)
• Completeness results for basic narrowing
• Unification theory
• Basic narrowing revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Narrowing vs. SLD-resolution
• Foundations of equational logic programming
• Kernel-LEAF: A logic plus functional language
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Horn equational theories and paramodulation
• Title not available (Why is that?)
• Extending SLD resolution to equational horn clauses using E-unification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Login: a logic programming language with built-in inheritance
• The relation between logic and functional languages: a survey
• Extended unification algorithms for the integration of functional programming into logic programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic programming with equations
• Conditional equational theories and complete sets of transformations
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Termination of narrowing revisited
• Incremental Linear Constraint Solving and Detection of Implicit Equalities
• Title not available (Why is that?)
• An execution scheme for interactive problem-solving in concurrent constraint logic programming languages
• Modular Termination of Basic Narrowing
• Title not available (Why is that?)
• A modular order-sorted equational generalization algorithm
• A compositional semantic basis for the analysis of equational Horn programs

Uses Software

• BABEL
• Kernel-LEAF

This page was built for publication: Incremental constraint satisfaction for equational logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367535)