1743 search results - page 13 / 349 » Generalized Modal Satisfiability |
91
Voted
JOLLI
2008
15 years 24 days ago
2008
Saul Kripke's thesis that ordinary proper names are rigid designators is supported by widely shared intuitions about the occurrence of names in ordinary modal contexts. By th...
115
Voted
KDD
2002
ACM
16 years 1 months ago
2002
ACM
Data on individuals and entities are being collected widely. These data can contain information that explicitly identifies the individual (e.g., social security number). Data can ...
129
click to vote
FOSSACS
1999
Springer
15 years 5 months ago
1999
Springer
This paper presents a mu-calculus-based modal logic for describing properties of reactive probabilistic labeled transition systems (RPLTSs) and develops a modelchecking algorithm ...
87
Voted
CORR
2010
Springer
15 years 28 days ago
2010
Springer
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete in the presence of unrestricted axioms. Sev...
104
click to vote
JAIR
2006
15 years 24 days ago
2006
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...