Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 616 for “"logics"”.
-
Modal logics of provability
… can be represented in such theories. Modal logics of provability are modal logics which attempt to express the concept of 'provability' and 'consistency' using the modal operators '[]' and '<>' respectively. This is achieved by forcing '[]' to behave like the provability predicate. GL is a …
-
Guarded logics : algorithms and bisimulation
… properties of modal, temporal, and description logics to a larger fragment of predicate logic. Besides decidability, guarded logics inherit the finite model property, invariance under an appropriate variant of bisimulation, and other nice model theoretic properties including a decidable …
-
Pure and applied fixed point logics
Fixed-point logics are logics with an explicit operator for forming fixed points of definable mappings. They are particularly well suited for modelling recursion in logical languages and consequently they have found applications in various areas of theoretical computer science such as database …
-
SERVICE LEARNING: AN INSTITUTIONAL LOGICS APPROACH
… may be impeded by competing institutional logics, thereby disrupting the change process. This study proposed three questions aimed at examining and understanding the perceptions of social actors as it relates to transformational change in medical education: 1) What is the impact of …
-
Document Verification with Temporal Description Logics
… criteria. The resulting new temporal description logics ALCCTL can - in contrast to existing specification formalisms - compactly represent coherence criteria on documents. Verification of web documents is modelled as a model checking problem of ALCCTL. The decidability and polynomial complexity …
-
Symmetric Circuits and Model-Theoretic Logics
… defining and studying extensions of fixed-point logics, which we call generalised operators. These operators generalise Lindström quantifiers as well as the counting and rank operators used to define FPC and fixed-point logic with rank (FPR). We also show that in order to define a symmetric …
-
Reasoning about knowledge using extensional logics
When representing statements about knowledge in an extensional logic, it occasionally happens that undesired conclusions arise. Such extraneous conclusions are often the result of substitution of equals for equals or existential instantiation within intensional operators such as Know. In the past, …
-
Human Reasoning and Description Logics: Applying Psychological Theory to Understand and Improve the Usability of Description Logics
Description Logics (DLs) are now the most commonly used ontology languages, in part because of the development of the Web Ontology Language (OWL) standards. Yet it is accepted that DLs are difficult to comprehend and work with, particularly for ontology users who are not computer scientists. The …
-
Qualitative Spatial Reasoning With Super-Intuitionistic Logics
… mereotopology, encodings based on non-classical logics are some of the possible answers that have emerged in connection with this problem. The present analysis is based on the well-known topological semantics of intuitionistic logic. That semantics is considered here from the point of view of the …
-
Beyond Generosity: The Action Logics in Philanthropy
… research agenda, explored how the action logics of a sample of donors affect philanthropic giving. The purpose was to (1) identify donors’ action logics, (2) explore what types of influences a donor’s action logic may have on a donor’s philanthropic decisions; and (3) determine how, if at …
-
Axiom-Pinpointing in Description Logics and Beyond
Building and mantaining large-scale ontologies is an error-prone task. It is thus not uncommon to find unwanted or unexpected consequences that follow implicitely from the restrictions in the ontology. To understand and correct these consequences, it is helpful to find the specific portions of the …
-
Action, Time and Space in Description Logics
Description Logics (DLs) are a family of logic-based knowledge representation (KR) formalisms designed to represent and reason about static conceptual knowledge in a semantically well-understood way. On the other hand, standard action formalisms are KR formalisms based on classical logic designed …
-
Formal Concept Analysis Methods for Description Logics
… presents mainly two contributions to Description Logics (DLs) research by means of Formal Concept Analysis (FCA) methods: supporting bottom-up construction of DL knowledge bases, and completing DL knowledge bases. Its contribution to FCA research is on the computational complexity of computing …
Page 1 of 31