Resource-distribution via Boolean constraints

DOI10.1145/601775.601778zbMATH Open1407.03078OpenAlexW2112448481MaRDI QIDQ5267424FDOQ5267424

David Pym, James Harland

Publication date: 13 June 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/601775.601778

zbMATH Keywords

substructural logicsalgebrassequent calculusrelevant logicsBoolean constraintsproof-search

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cited In (8)

• Bunched sequential information
• Temporal BI: proof system, semantics and translations
• Resourceful program synthesis from graded linear types
• Focussing and proof construction
• Title not available (Why is that?)
• Reductive logic, proof-search, and coalgebra: a perspective from resource semantics
• Efficient resource management for linear logic proof search
• Title not available (Why is that?)

   Recommendations

• Resource-distribution via Boolean constraints 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A multicriteria problem of distribution of bounded resources 👍 👎
• Resource constrained assignment problems 👍 👎
• Strategy-proof assignment of multiple resources 👍 👎
• Decomposition of uniform resource allocation problems 👍 👎
• Resource allocation and capacity assignment in distributed systems 👍 👎

This page was built for publication: Resource-distribution via Boolean constraints

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