Using Resolution for Testing Modal Satisfiability and Building Models. Hustadt, U. & Schmidt, R. A. Journal of Automated Reasoning, 28(2):205-232, February, 2002.
Paper abstract bibtex This paper presents a translation-based resolution decision procedure for the multi-modal logic $K}_{(m)}(∩,∪,⌣)$ defined over families of relations closed under intersection, union and converse. The relations may satisfy certain additional frame properties. Different from previous resolution decision procedures which are based on ordering refinements our procedure is based on a selection refinement, the derivations of which correspond to derivations of tableaux or sequent proof systems. This procedure has the advantage that it can be used both as a satisfiability checker and a model builder. We show that tableaux and sequent-style proof systems can be polynomially simulated with our procedure. Furthermore, the finite model property follows for a number of extended modal logics.
@ARTICLE{Hustadt+Schmidt@JAR2002,
AUTHOR = {Hustadt, U. and Schmidt, R. A.},
YEAR = {2001},
TITLE = {Using Resolution for Testing Modal Satisfiability and Building Models},
JOURNAL = {Journal of Automated Reasoning},
VOLUME = {28},
NUMBER = {2},
YEAR = {2002},
PAGES = {205-232},
MONTH = feb,
ISSN = {0168-7433},
URL = {http://dx.doi.org/10.1023/A:1015067300005},
ABSTRACT = {This paper presents a translation-based resolution decision
procedure for the multi-modal logic $\textit{K}_{(m)}(\cap,\cup,\smile)$
defined over families of relations closed under intersection, union and
converse. The relations may satisfy certain additional frame properties.
Different from previous resolution decision procedures which are based
on ordering refinements our procedure is based on a selection refinement,
the derivations of which correspond to derivations of tableaux or sequent
proof systems. This procedure has the advantage that it can be used
both as a satisfiability checker and a model builder. We show that
tableaux and sequent-style proof systems can be polynomially simulated
with our procedure. Furthermore, the finite model property follows for
a number of extended modal logics.},
}
Downloads: 0
{"_id":"ZMfZ2yZG3eAsBimSR","bibbaseid":"hustadt-schmidt-usingresolutionfortestingmodalsatisfiabilityandbuildingmodels-2002","author_short":["Hustadt, U.","Schmidt, R. A."],"bibdata":{"bibtype":"article","type":"article","author":[{"propositions":[],"lastnames":["Hustadt"],"firstnames":["U."],"suffixes":[]},{"propositions":[],"lastnames":["Schmidt"],"firstnames":["R.","A."],"suffixes":[]}],"year":"2002","title":"Using Resolution for Testing Modal Satisfiability and Building Models","journal":"Journal of Automated Reasoning","volume":"28","number":"2","pages":"205-232","month":"February","issn":"0168-7433","url":"http://dx.doi.org/10.1023/A:1015067300005","abstract":"This paper presents a translation-based resolution decision procedure for the multi-modal logic $<i>K</i>}_{(m)}(∩,∪,⌣)$ defined over families of relations closed under intersection, union and converse. The relations may satisfy certain additional frame properties. Different from previous resolution decision procedures which are based on ordering refinements our procedure is based on a selection refinement, the derivations of which correspond to derivations of tableaux or sequent proof systems. This procedure has the advantage that it can be used both as a satisfiability checker and a model builder. We show that tableaux and sequent-style proof systems can be polynomially simulated with our procedure. Furthermore, the finite model property follows for a number of extended modal logics.","bibtex":"@ARTICLE{Hustadt+Schmidt@JAR2002,\n AUTHOR = {Hustadt, U. and Schmidt, R. A.},\n YEAR = {2001},\n TITLE = {Using Resolution for Testing Modal Satisfiability and Building Models},\n JOURNAL = {Journal of Automated Reasoning},\n VOLUME = {28},\n NUMBER = {2},\n YEAR = {2002},\n PAGES = {205-232},\n MONTH = feb,\n ISSN = {0168-7433},\n URL = {http://dx.doi.org/10.1023/A:1015067300005},\n ABSTRACT = {This paper presents a translation-based resolution decision\n procedure for the multi-modal logic $\\textit{K}_{(m)}(\\cap,\\cup,\\smile)$\n defined over families of relations closed under intersection, union and\n converse. The relations may satisfy certain additional frame properties.\n Different from previous resolution decision procedures which are based\n on ordering refinements our procedure is based on a selection refinement,\n the derivations of which correspond to derivations of tableaux or sequent\n proof systems. This procedure has the advantage that it can be used\n both as a satisfiability checker and a model builder. We show that\n tableaux and sequent-style proof systems can be polynomially simulated\n with our procedure. Furthermore, the finite model property follows for\n a number of extended modal logics.}, \n}\n","author_short":["Hustadt, U.","Schmidt, R. A."],"key":"Hustadt+Schmidt@JAR2002","id":"Hustadt+Schmidt@JAR2002","bibbaseid":"hustadt-schmidt-usingresolutionfortestingmodalsatisfiabilityandbuildingmodels-2002","role":"author","urls":{"Paper":"http://dx.doi.org/10.1023/A:1015067300005"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"http://cgi.csc.liv.ac.uk/~ullrich/publications/all.bib?authorFirst=1","dataSources":["WhiGijHmCtTSdLaAj","FgmYE34DdKWThg2dR"],"keywords":[],"search_terms":["using","resolution","testing","modal","satisfiability","building","models","hustadt","schmidt"],"title":"Using Resolution for Testing Modal Satisfiability and Building Models","year":2002}