| R. A. Schmidt and U. Hustadt. A resolution decision procedure for fluted logic. In Automated Deduction---CADE-17, vol. 1831 of LNAI, pp. 433--448. Springer, 2000. |
No context found.
R. A. Schmidt and U. Hustadt. A resolution decision procedure for fluted logic. In Automated Deduction---CADE-17, vol. 1831 of LNAI, pp. 433--448. Springer, 2000.
No context found.
R. A. Schmidt and U. Hustadt. A resolution decision procedure for fluted logic. In Proc. CADE-17, vol. 1831 of LNAI, pp. 433--448. Springer, 2000.
No context found.
R. A. Schmidt and U. Hustadt. A resolution decision procedure for fluted logic. In D. McAllester, editor, Proceedings of the Seventeenth International Conference on Automated Deduction (CADE-17), volume 1831 of Lecture Notes in Artificial Intelligence, pages 433--448. Springer, 2000.
....By constructing decision procedures for these decidable fragments, one obtains generic decision procedures for modal logics and the corresponding description logics. Resolution decision procedures have been developed for the guarded fragment [12, 20] for Maslov s class K [43] for fluted logic [71] and various other classes related to modal logics, see e.g. 17, 29, 40] In this paper we consider only the relationship to a fragment of clausal logic based on the two variable fragment. The fragment is called DL # [13] It is a variation of the class of DL clauses, that was introduced in [45] ....
R. A. Schmidt and U. Hustadt. A resolution decision procedure for fluted logic. In D. McAllester, editor, Proceedings of the 17th International Conference on Automated Deduction (CADE-17), volume 1831 of Lecture Notes in Artificial Intelligence, pages 433--448. Springer, 2000. 29
....of , which contains closed first order formulae, is not in GF1 . There are a number of other fragments of first order logic and clausal classes which would cover the same modal and description logics, including the guarded fragment [1] the dual of Maslov s class K [17] and fluted logic [24]. The clausal classes corresponding to the guarded fragment [12] and the dual of Maslov s class K contain only clause sets where every non constant functional term t contains all the variables of the clause C in which it occurs. Clause 6 on page 5 illustrates that this is not the case for sets. ....
.... covers many familiar description logics and the corresponding extended propositional modal logics, for example the description logic with inverse roles, conjunctions and disjunctions of roles and the corresponding modal logics below K (m) #, #) Although recent results (see e.g. [10, 11, 12, 17, 18, 19, 24]) show that 16 ordered resolution is the more powerful method when decidability is an issue, an advantage of hyperresolution is that it can be used for Herbrand model generation without the need for extra machinery, except when we want to generate minimal Herbrand models for which a modest ....
R. A. Schmidt and U. Hustadt. A resolution decision procedure for fluted logic. In Proc. CADE-17, vol. 1831 of LNAI, pp. 433--448. Springer, 2000.
.... description logic and its extensions by disjunction, conjunction, negation and inverse on roles and discuss their relationship to less well known logics including Boolean modal logic [7] the two variable fragment, the dual of the Maslov s class K [21] Quine s fluted logic [25, 26] see also [24, 28]) and the positive restrictive quantification fragment PRQ [2] Unless indicated otherwise, the logics considered in this paper do not include equality. and modal logics We briefly state the definition of the description logic [29] The concept language of is defined over a signature, ....
....have child(y, x, z) we see that it is y that has to come directly before x. Again, both constraints on the ordering on variables cannot be satisfied at the same time. Because in fluted logic the relational atoms may be negated, ALC( and the Boolean modal logic can be embedded into fluted logic [28]. More precisely, it can be shown that translations of description logic and modal logic formulae by both the relational translation and a variation of the functional translation are fluted formulae [27] In fact, there are two natural fragments of fluted logic which are relevant to description ....
[Article contains additional citation context not shown here]
R. A. Schmidt and U. Hustadt. A resolution decision procedure for fluted logic. In Proc. CADE-17, vol. 1831 of LNAI, pp. 433--448. Springer, 2000.
No context found.
R. Schmidt and U. Hustadt. A Resolution Decision Procedure for Fluted Logic. In D. A. McAllester, editor, Automated Deduction - CADE-17, 17th International Conference on Automated Deduction, volume 1831 of Lecture Notes in Computer Science, pages 433-448. Springer Verlag, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC