Sciweavers

58 search results - page 6 / 12
» On Evaluating Decision Procedures for Modal Logic
Sort
View
PLDI
2009
ACM
14 years 8 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
CADE
1998
Springer
13 years 11 months ago
System Description: leanK 2.0
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
Bernhard Beckert, Rajeev Goré
CSFW
2012
IEEE
11 years 9 months ago
Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
Valerio Genovese, Deepak Garg, Daniele Rispoli
DLOG
2007
13 years 9 months ago
Deciding ALBO with Tableau
Abstract. This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state-of-the-art tableau-based description logic systems. I...
Renate A. Schmidt, Dmitry Tishkovsky
JELIA
2004
Springer
14 years 22 days ago
Practical Reasoning for Uncertain Agents
Logical formalisation of agent behaviour is desirable, not only in order to provide a clear semantics of agent-based systems, but also to provide the foundation for sophisticated r...
Nivea de Carvalho Ferreira, Michael Fisher, Wiebe ...