Deriving constraints among argument sizes in logic programs

DOI10.1007/BF01530930zbMATH Open0875.68237OpenAlexW1490224653MaRDI QIDQ1360682FDOQ1360682

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

• Convex Analysis
• Title not available (Why is that?)
• Redundancy in mathematical programming. A state-of-the-art survey
• Implementation of logical query languages for databases
• Minimal representation of convex polyhedral sets
• On the convergence of query evaluation
• Title not available (Why is that?)

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)