scientific article; zbMATH DE number 870438

zbMath0849.68010MaRDI QIDQ4875865

Pierre Deransart, Jan Małuszyński

Publication date: 25 April 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

logic programmingcontext-free grammar rulesrelational attribute grammars

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42) Logic programming (68N17)

Related Items (18)

Evolution of rule-based programs ⋮ Termination of constraint logic programs ⋮ Constrained dependencies ⋮ On Completeness of Logic Programs ⋮ On Correctness and Completeness of an n Queens Program ⋮ A relaxed condition for avoiding the occur-check ⋮ S-semantics -- an example ⋮ On the complexity of regular-grammars with integer attributes ⋮ Logic + control: On program construction and verification ⋮ Model-based computing: Developing flexible machine control software ⋮ Proving completeness of logic programs with the cut ⋮ Efficient reconfigurable embedded parsers ⋮ Proof methods of declarative properties of definite programs ⋮ Set constraints with intersection ⋮ Modules and specifications ⋮ Synchronized Regular Expressions ⋮ Case injected genetic algorithms for traveling salesman problems ⋮ A backward slicing algorithm for Prolog

This page was built for publication: