125 search results - page 16 / 25 » A Logic of Probability with Decidable Model Checking |
103
click to vote
RR
2009
Springer
15 years 6 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...
103
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
104
click to vote
COMPSAC
2009
IEEE
15 years 4 months ago
2009
IEEE
Given the rapid rise of model-driven software development methodologies, it is highly desirable that tools be developed to support the use of design patterns in this context. This...
ENTCS
2010
14 years 9 months ago
2010
We present MLSolver, a tool for solving the satisfiability and validity problems for modal fixpoint logics. The underlying technique is based on characterisations of satisfiabilit...
104
click to vote
FOSSACS
2006
Springer
15 years 3 months ago
2006
Springer
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The ...