398 citations
- Dalle Molle Institute for Artificial Intelligence ResearchCH4 papers
- The University of MelbourneAU3 papers
- Australian National UniversityAU2 papers
- Chinese University of Hong KongHK2 papers
- UNSW SydneyAU2 papers
- Centrum Wiskunde & InformaticaNL1 paper
- École Polytechnique Fédérale de LausanneCH1 paper
- Graz University of TechnologyAT1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
- Laboratoire d'Informatique de l'École PolytechniqueFR1 paper
- Laboratoire d’Informatique Fondamentale de MarseilleFR1 paper
- Leiden UniversityNL1 paper
Showing 2007 · cs.LOShow all
2 papers · 2 filters
cs.LO2007
An On-the-fly Tableau-based Decision Procedure for PDL-Satisfiability
Pietro Abate, Rajeev Goré, Florian Widmann
We present a tableau-based algorithm for deciding satisfiability for propositional dynamic logic (PDL) which builds a finite rooted tree with ancestor loops and passes extra inform…
cs.LO2007
The Bedwyr system for model checking over syntactic expressions
David Baelde, Andrew Gacek, Dale Miller +2
Bedwyr is a generalization of logic programming that allows model checking directly on syntactic expressions possibly containing bindings. This system, written in OCaml, is a direc…