Deriving constraints among argument sizes in logic programs

DOI10.1007/BF01530930MaRDI QIDQ1360682zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 4072437 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Convex Analysis
• Implementation of logical query languages for databases
• Minimal representation of convex polyhedral sets
• On the convergence of query evaluation
• Redundancy in mathematical programming. A state-of-the-art survey

Cited in

(1)

• Using acceptors as transducers

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

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