Wyniki wyszukiwania - Biblioteka Nauki

1

O rozstrzygalności teologii

100%

Olszewski A.

Teologia w Polsce

|

2020

|

tom 14

|

nr 2

77-102

EN

The paper takes a synthetic, not an analytical approach to the title issue. From the methodological point of view, it is an attempt to apply logical notions such as consequence, proof, rule and decidability to theology as a whole. In the first part (to the paragraph 3.1) the theology is considered as a logical theory and the drawbacks of such an approach are pointed out, including the impossibility of a sensible consideration of the decidability of such a theology. The second part weakens the logical notion of decidability and narrows down the notion of theology for which the weakened decidability can be applied. The whole discussion poses a lot of problems concerning theology, which probably theologians should solve. The work is quite controversial for both sides: theologians and logicians. To make it easier for theologians to read the paper, a glossary of loosely worded terms of logical terms has been added.

2

Decidability w.r.t. Logical Consecutions of Linear Temporal Logic Extended by Since and Previous

86%

Rybakov V. V.

Fundamenta Informaticae

|

2007

|

tom Vol. 81, nr 1-3

297-313

EN

This paper aims to prove that the linear temporal logic LTLu,sn, n-1(N) , which is an extension of the standard linear temporal logic LTL by operations Since and Previous (LTL itself, as standard, uses only Until and Next) and is based on the frame of all natural numbers N, as generating Kripke/Hintikka structure, is decidable w.r.t. admissible consecutions (inference rules). We find an algorithm recognizing consecutions admissible in LTLu,sn, n-1(N) . As a consequence this algorithm solves satisfiability problem and shows that LTLu,sn, n-1(N) itself is decidable, despite LTLu,sn, n-1(N) does not have the finite model property.

3

Deriving and retrieving contextual categorical information through instance inheritance

86%

Analyti A. , Spyratos N. , Constantopoulos P.

Fundamenta Informaticae

|

2000

|

tom Vol. 44, Nr 4

321-351

EN

In semantic and object-oriented data models, each class has one or more typing properties that associate it to other classes, and carry type information about all instances of the class. We introduce a new kind of property that we call instance-typing property. An instance-typing property associates an instance of a class to another class, and carries type information about that particular instance (and not about all instances of the class). Instance-typing properties are important as they allow to represent summary information about an instance, in addition to specific information. In this paper, we study inheritance of properties from a class to an instance, using type information about the class, as well as type information about the instance. This kind of inheritance, that we call contextual instance-inheritance, provides us with the most specific type information about the instance, in a particular context. Intuitively, a context is a metaclass of interest with respect to which this most specific information is determined. We demonstrate that contextual instance-inheritance is a powerful conceptual modeling mechanism, capable of expressing valuable information about instances. We also provide a framework in which derived instance-inherited properties can be represented and retrieved in the same way as "usual" properties.

4

On the semantics of a semantic network

86%

Analyti A. , Spyratos N. , Constantopoulos P.

Fundamenta Informaticae

|

1998

|

tom Vol. 36, nr 2,3

109-144

EN

We elaborate on the semantics of an enhanced object-oriented semantic network, where multiple instantiation, multiple specialization, and meta-classes are supported for both kinds of objects: entities and properties. By semantics of a semantic network, we mean the information (both explicit and derived) that the semantic network carries. Several data models use semantic networks to organize information. However, many of these models do not have a formalism defining what the semantics of the semantic network is. In our data model, in addition to the Isa relation, we consider a stronger from of specialization for properties, that we call restriction Isa, or Risa for short. The Risa relation expresses property value refinement. A distinctive feature of our data model is that it supports the interaction between Isa and Risa relations. The combination of Isa and Risa provides a powerful conceptual modeling mechanism. The user declares objects and relations between objects through a program. Reasoning is done through a number of (built-in) inference rules that allow for derivations both at instance and schema level. Through the inference rules, new objects and new relations between objects are derived. In our data model, inherited properties are considered to be derived objects. In addition to the inference rules, a number of (built-in) system constraints exist for checking the validity of a program.

5

O rozstrzygalności teologii

72%

Olszewski A.

Teologia w Polsce

|

2020

|

tom 14

|

nr 2

77-102

EN

The paper takes a synthetic, not an analytical approach to the title issue. From the methodological point of view, it is an attempt to apply logical notions such as consequence, proof, rule and decidability to theology as a whole. In the first part (to the paragraph 3.1) the theology is considered as a logical theory and the drawbacks of such an approach are pointed out, including the impossibility of a sensible consideration of the decidability of such a theology. The second part weakens the logical notion of decidability and narrows down the notion of theology for which the weakened decidability can be applied. The whole discussion poses a lot of problems concerning theology, which probably theologians should solve. The work is quite controversial for both sides: theologians andlogicians. To make it easier for theologians to read the paper, a glossary of loosely worded terms of logical terms has been added.

PL

W pracy przedstawiono syntetyczne, a nie analityczne, ujęcie tytułowego zagadnienia. Od strony metodologicznej jest próbą aplikacji pojęć logicznych jak konsekwencja, dowód, rozstrzygalność do teologii jako całości. W pierwszej części (do pkt 3.1) rozważa się teologię jako teorię logiczną i wskazuje na wady takiego ujęcia, w tym na niemożliwość sensownego rozważania rozstrzygalności tak rozumianej teologii. W drugiej części zostało osłabione logiczne pojęcie rozstrzygalności oraz zawężone pojęcie teologii, dla którego osłabiona rozstrzygalność daje się zastosować. W rozważaniach postawiono mnóstwo problemów dotyczących teologii, które chyba teologowie powinni rozwiązać. Praca jest dość kontrowersyjna dla obu stron, czyli teologów i logików. Aby ułatwić teologom lekturę pracy, dodano słowniczek luźno sformułowanych określeń terminów logicznych.

6

Coinductive axiomatization of recursive type equality and subtyping

72%

Brandt M. , Henglein F.

Fundamenta Informaticae

|

1998

|

tom Vol. 33, nr 4

309-338

EN

We present new sound and complete axiomatizations of type equality and subtype inequality for a first-order type language with regular recursive types. The rules are motivated by coinductive characterizations of type containment and type equality via simulation and bisimulation, respectively. The main novelty of the axiomatization is the fixpoint rule (or coinduction principle). It states that from A,Pý P one may deduce Aý P, where P is either a type equality t = t1 or type containment t

7

Inference rules in machine state forecasting

72%

Tylicki H. F.

Teka Komisji Motoryzacji i Energetyki Rolnictwa

|

2007

|

tom 07A