Pages that link to "Item:Q4815032"
From MaRDI portal
The following pages link to Bounded LTL model checking with stable models (Q4815032):
Displaying 17 items.
- Exploiting step semantics for efficient bounded model checking of asynchronous systems (Q436411) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Logic programs with abstract constraint atoms: the role of computations (Q969538) (← links)
- Model checking multi-agent systems with logic based Petri nets (Q2426108) (← links)
- SMT-based scenario verification for hybrid systems (Q2441772) (← links)
- Reasoning about actions with \(\mathcal{EL}\) ontologies and temporal answer sets for DLTL (Q2694571) (← links)
- Bounded model checking with SNF, alternating automata, and Büchi automata (Q2849598) (← links)
- Semi-external LTL Model Checking (Q3512515) (← links)
- A translational approach to constraint answer set solving (Q3585161) (← links)
- Logic programming for finding models in the logics of knowledge and its applications: A case study (Q3585176) (← links)
- Justifications for logic programs under answer set semantics (Q3612602) (← links)
- (Q4804902) (← links)
- (Q5089224) (← links)
- Reasoning about actions with Temporal Answer Sets (Q5299584) (← links)
- Business process verification with constraint temporal answer set programming (Q5398302) (← links)
- Formal Methods in Computer-Aided Design (Q5492984) (← links)
- Theory and Applications of Satisfiability Testing (Q5713732) (← links)