Bounded ITL model checking with stable models

DOI10.1007/3-540-45402-0_15MaRDI QIDQ4798010zbMATH OpenFDO

Authors Keijo Heljanko, Ilkka Niemelä

Publication date 18 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2173/21730200.htm

Mathematics Subject Classification ID

Logic programming (68N17) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Bounded LTL model checking with stable models
• Model Checking Abstract State Machines with Answer Set Programming
• scientific article; zbMATH DE number 1337888
• Bounded reachability checking with process semantics
• Model checking LTL using constraint programming

Cited in

(7)

• On the equivalence and range of applicability of graph-based representations of logic programs.
• scientific article; zbMATH DE number 1337888 (Why is no real title available?)
• Bounded reachability checking with process semantics
• Bounded LTL model checking with stable models
• Model Checking Abstract State Machines with Answer Set Programming
• Bounded model checking with QBF
• Enhancing disjunctive logic programming systems by SAT checkers

Describes a project that uses

Uses Software

• Smodels

This page was built for publication: Bounded ITL model checking with stable models

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