Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423155 | Electronic Notes in Theoretical Computer Science | 2009 | 21 Pages |
Abstract
We introduce special pseudo-models for the interval logic of proper subintervals over dense linear orderings. We prove finite model property with respect to such pseudo-models, and using that result we develop a decision procedure based on a sound, complete, and terminating tableau for that logic. The case of proper subintervals is essentially more complicated than the case of strict subintervals, for which we developed a similar tableau-based decision procedure in a recent work.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics