A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
While reasoning in ALC plus self-reference is known to be undecidable, it has recently been shown that one can often safely restrict self-reference to at most two indirections (allowing the definition ... The translation goes into ALCHIQ (without Boolean roles) and therefore can be used in combination with off-the-shelf reasoners for OWL. ... The good computational behavior of ALCQme 2 does not transfer to other logics with bounded self-reference: already ALCme 3 has an undecidable satisfiability problem  . ...dblp:conf/dlog/GorinSW13 fatcat:ei2g7kiihjazlkqaxw7ukz7jqq
There is also formal linguistic self-reference of the kind used by Gédel, expressed with proof predicates and ignored by most math- ematicians. ... The author recognizes two types of mathematical self-reference. There is the functorial self-reference of the recursion theorem. ...
A complete axiomatization of the logic is also provided. ... Abadi has introduced a logic to explicate the meaning of local names in SDSI, the Simple Distributed Security Infrastructure proposed by Rivest and Lampson. ... Acknowledgments Work on this paper was done while the second author was with the School of Computing Sciences, University of Technology, Sydney. ...arXiv:cs/0001026v1 fatcat:hk7cqwfe7bhidopijsbu6rwlzm
Self-reference has been recognized as a useful feature in description logics but is known to cause substantial problems with decidability. ... We have shown in previous work that the basic description logic ALC remains decidable, and in fact retains its low complexity, when extended with a bounded form of self-reference where only one variable ... Moreover, we acknowledge discussions with Erwin R. Catesbeiana on the merits of consistency. ...dblp:conf/aiml/GorinS12 fatcat:g6tcmfif35e23gvzhosjrnhln4
Several examples of such sentences show that a quantificational interpretation is sometimes more natural than a direct reference interpretation. ... This paper argues against the commonly accepted direct refer- ence interpretation of “that” sentences. ...
Practical results presented in the paper show that logic programs that use reflection can be shorter, more readable and efficient than those using more conventional full meta-interpretation techniques. ... The most widespread and straightforward technique for building systems based on meta-programming techniques in logic is to write a full (Prolog) meta-interpreter . 7, 8 Meta-interpreters explicitly reproduce ... We would also like to thank the anonymous referees and the editor in chief for their pertinent remarks and suggestions, and for the help they gave us in improving this paper. ...doi:10.1002/spe.4380210605 fatcat:bnfcjdnhh5arngn7xyhjbszhky
as rational self-knowledge. ... I shall deal with each of these issues in turn. ... We can identify this common assumption, if we follow the interpretative line originally proposed by Sadik Al-Azm who interprets the antinomies with reference to the Leibniz/Newton dispute set out in Leibniz's ...doi:10.1017/s0263523200007904 fatcat:56mj4zs7rnahtd6welabk35esy
Since they shape the way units interpret their discretion and use their delegated authority, such logic ultimately leads to self-serving opportunistic behaviors with little or no concern for corporate ... The fourth scenario implies a logic of low self-interest coupled with low bounded rationality. ...doi:10.1177/0149206316648383 fatcat:qckegpfe5zhfln6ax2oupmr2hu
We define an alternative technique for using OCL with UML and model transformations which avoids the use of null and undefined values, and we present verification techniques for a transformation language ... In addition, these values complicate the logic of OCL and of transformation languages that use OCL, making it difficult to provide effective verification support for these languages. ... This interpretation is consistent with the use of multiplicity bounds for other many-valued association ends, and is also already adopted in OCL in the case that collection operators are applied to the ...dblp:conf/staf/Lano14 fatcat:eugichdanbbvvanvzfctcy2nm4
Sections 2.3 and 3.1, with reference to section 1, are meant to exhibit the usefulness of SL in this regard. ... SL could also be used to formalize and clarify arguments given with the logic of soku, although this has not been attempted here; and it could be used to develop further criticisms of the logic generally ...doi:10.1353/pew.2004.0017 fatcat:d4usxyb75rfsjfa4xlf5tghwyq
The author points out the pattern that relates the fixed point theorem in lambda calculus to recursive forms, self-reference and Gédel’s incompleteness theorem. ... This leads to a stronger theorem with the same bounded tableau search as its computational content. ...
Let H be a bounded self-adjoint opera- tor of the Hilbert space. ... Lengyel: Bounded self-adjoint operators and the problem of moments. In this paper, a connection is established between the theory of moments and the theory of bounded self-adjoint operators. ...
One of the attractions of a dialetheic approach to the paradoxes of self-reference is that this move may be avoided. ... The contradictions delivered by these notions are forthcoming, but they are quarantined by the use of a paraconsistent logic. ... By standard techniques of self-reference, we can construct a sentence, D, of the form V ( D , ⊥ ), where ⊥ is a logical constant such that, in LP , ⊥ |= A, for any A. ...doi:10.21146/2074-1472-2020-26-1-48-59 fatcat:ntjbrgmdjjbzvo6ban64uprr6m
But natural theology can hardly deal with the Incarnation, and therefore it can hardly begin to deal with the self which so many discover through introspection: not the self who feels himself bound by ... Thus one is left with the uneasy feeling that even though Campbell may be right in his logic, he is not contributing a great deal to our theological or philo- sophical understanding at the present time ...
On interpretation (i) of (24a,b), migigawa is interpreted as bound to an I.F.O.R. whose reference object is Taro; on interpretation (ii), in contrast, it is bound to a R.F.O.R. which has the speaker as ... (Pollard and Sag 1992:274) For this reason, they have been often referred to as "logophoric". ...doi:10.1007/s11168-006-9020-0 fatcat:5fcwr44utvbt5bj7ueacdagzda
« Previous Showing results 1 — 15 out of 216,110 results