Deriving constraints among argument sizes in logic programs

DOI10.1007/BF01530930zbMath0875.68237OpenAlexW1490224653MaRDI QIDQ1360682

Allen van Gelder

Publication date: 27 October 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01530930

zbMATH Keywords

polyconegeneralized Tucker representation

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (1)

Using acceptors as transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Redundancy in mathematical programming. A state-of-the-art survey
• On the convergence of query evaluation
• Minimal representation of convex polyhedral sets
• Implementation of logical query languages for databases
• Convex Analysis

This page was built for publication: Deriving constraints among argument sizes in logic programs