Efficient Algorithms for Description Problems over Finite Totally Ordered Domains

DOI10.1137/050635900zbMath1187.68260OpenAlexW1996426177MaRDI QIDQ3631897

Miki Hermann, Gernot Salzer, Angel J. Gil, Bruno Zanuttini

Publication date: 22 June 2009

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3e3284dca26a707d4a41f73eb0ce6a0276dfcbdf

zbMATH Keywords

complexityalgorithmsfinite domaindescription problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Logic in artificial intelligence (68T27)

Related Items (3)

A first polynomial non-clausal class in many-valued logic ⋮ A note on some collapse results of valued constraints ⋮ MCP: capturing big data by satisfiability (tool description)

This page was built for publication: Efficient Algorithms for Description Problems over Finite Totally Ordered Domains