504 search results - page 38 / 101 » Reasoning about local properties in modal logic |
122
Voted
LICS
1994
IEEE
15 years 6 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
118
Voted
LFCS
1992
Springer
15 years 5 months ago
1992
Springer
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
116
Voted
LOPSTR
2009
Springer
15 years 8 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
130
click to vote
CADE
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. I...
133
Voted
JSC
2000
15 years 1 months ago
2000
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...