Predicate-calculus-based logics for modeling and solving search problems

DOI10.1145/1119439.1119441zbMath1367.68264OpenAlexW2041526687MaRDI QIDQ5277742

Deborah East, Miroslaw Truszczynski

Publication date: 12 July 2017

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

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

zbMATH Keywords

satisfiabilityconstraintspredicate logicsearch problemspseudo-Boolean constraints

Mathematics Subject Classification ID

Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (5)

On abstract modular inference systems and solvers ⋮ Debugging for Model Expansion ⋮ What is answer set programming to propositional satisfiability ⋮ atalog: A logic language for expressing search and optimization problems ⋮ Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic

This page was built for publication: Predicate-calculus-based logics for modeling and solving search problems