From (Quantified) Boolean Formulae to Answer Set Programming

DOI10.1093/LOGCOM/EXN041MaRDI QIDQ3395260zbMATH OpenOpenAlexFDO

Authors Igor Stéphan, Benoit da Mota, Pascal Nicolas

Publication date 24 August 2009

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://hal.univ-angers.fr/hal-03255405/document

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Answer set programming based on propositional satisfiability
• A satisfiability procedure for quantified Boolean formulae
• Answer set programming in intuitionistic logic
• scientific article; zbMATH DE number 1882048
• Contributions to the theory of practical quantified Boolean formula solving
• Automata, Languages and Programming
• scientific article; zbMATH DE number 6536279

Cited in

(3)

• Translating Preferred Answer Set Programs to Propositional Logic
• Automata, Languages and Programming
• Logic programming

Describes a project that uses

Uses Software

• QUBOS
• ASSAT
• Quaffle

This page was built for publication: From (Quantified) Boolean Formulae to Answer Set Programming

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