LoCo—A Logic for Configuration Problems
From MaRDI portal
Publication:2946729
DOI10.1145/2629454zbMath1354.68246OpenAlexW2050815510WikidataQ59259470 ScholiaQ59259470MaRDI QIDQ2946729
Heribert Vollmer, Markus Aschinger, Conrad Drescher, Georg Gottlob
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2629454
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generating all maximal independent sets
- Candidate keys for relations
- Extending and implementing the stable model semantics
- LoCo—A Logic for Configuration Problems
- Optimization Methods for the Partner Units Problem
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Alternation
- Interactive Cost Configuration Over Decision Diagrams
- On the Complexity of Computing Generators of Closed Sets
- Engineering an Incremental ASP Solver
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
This page was built for publication: LoCo—A Logic for Configuration Problems