Abstract: The development and use of ontologies may require users with no training in formal logic to handle complex concept descriptions (e.g., in the form of necessary conditions in class definitions). To aid such users, alternative representations of concept descriptions have been proposed, such as natural language paraphrases and visualization frameworks. We examine examples of those representations and propose a novel visual framework, where more emphasis is placed on the semantics of concept descriptions than on their syntax.
Abstract: Este trabalho apresenta esboços de modelos, uma abordagem baseada em semântica para visualização de descrições de conceitos em OWL.
Abstract: Many visualization frameworks for ontologies in general and for concept expressions in particular are too faithful to the syntax of the languages in which those objects are represented (e.g., RDF, OWL, DL). Model outlines depart from this tradition in that they consist of diagrams characterizing the class of models of a given concept expression. We hope this semantically-oriented visualization strategy will allow users to obtain deeper insights about the meaning of such expressions, thereby preventing errors of design or of interpretation.
Abstract: We present the structure of an ontology for Information Security (IS), applied to the extraction of knowledge from Natural Language texts (IS standards, security policies and security control descriptions). This ontology is composed of the vocabulary for the IS Domain, and a particular kind of ontology description, logical forms to determine the structure of the DL formulas associated with the texts. We also discuss the relationship between the structure of the formulas and the efficiency of the reasoner.
Abstract: Description Logics is a family of formalisms used to represent knowledge of a domain. In contrast with others knowledge representation systems, Description Logics are equipped with a formal, logic-based semantics. Knowledge representation systems based on description logics provide various inference capabilities that deduce implicit knowledge from the explicitly represented knowledge. We present a sequent calculus for ALC, a basic Description Logic. The first motivation for developing such a system is the extraction of computational content of ALC proofs. The present calculus is an intermediate step towards a Natural Deduction System for ALC.
Abstract: We present a structural model for (meta)heuristic search strategies for solving computational problems. The model is defined through the use of topos-theoretical tools and techniques which provide an appropriate internal logic (with the language of local set theory) where objects of interest can be represented.
Abstract: We present the structure of an ontology for Information Security (IS) and discuss a paradigm whereby it can be used to extract knowledge from natural language texts such as IS standards, security policies and security control descriptions. Besides providing a vocabulary for the IS domain, the proposed ontology stores logical forms corresponding to statements in the text, as well as a set of axioms used for inference in description logic (DL). We also describe a tool to provide automatic support for the formalization process.
Abstract: We define some topoi related to the topos of forests and illustrate how the internal language of such topoi can be used (via local set theory) to define logics where we can represent (meta)heuristic search strategies for solving computational problems.
Abstract: We present a structural model for (meta)heuristic search strategies for solving computational problems. The model is defined through the use of topos-theoretical tools and techniques which provide an appropriate internal logic (with the language of Local Set Theory) where objects of interest can be represented.
Abstract: This work employs concepts and tools from Category Theory and Topos Theory to construct a mathematical model for problems, reductions between problems, heuristic search spaces and strategies. More precisely, a search space construction strategy is represented by a functor from a certain category of problems to a certain category of forests. The collection of all such functors forms a topos, a specific model equipped with its own internal logic. This internal logic is then used to define search strategies and heuristics in Local Set Theory. Possible applications of this work include (1) the logical specification and classification of heuristics and metaheuristics used in practice and (2) a more abstract and general rendering of specific results relating the structure of problems to adequate problem-solving methods.
Abstract: A specification language for real-time software systems is presented, along with a model-theoretic semantics. Notions from Category Theory are used to specify how the components of a system should interact. The potential role of the proposed language in the search for interoperability of specification formalisms is briefly discussed.
Abstract: A specification language for real-time software systems is presented. Notions from Category Theory are used to specify how the components of a system should interact. The potential role of the proposed language in the search for interoperability of specification formalisms is briefly discussed.
Abstract: This dissertation defines RETOOL, an action logic featuring an operator to denote necessary conditions and postconditions of actions in a timed transition system (an extension of the formalism of transition systems meant to model real-time reactive/concurrent computational systems). A semantics for RETOOL is presented and compared to previous proposals. An adequate axiomatization is given, along with detailed correctness and weak completeness proofs.
Abstract: This paper discusses how RETOOL, an action logic featuring an operator that expresses necessary conditions, postconditions and time bounds of actions, can be combined with MTL, a linear-time temporal logic with time-bounded operators, to reason about general properties of timed transition systems, an abstract model for the behavior of objects in a real-time, object-oriented software system. The parallel composition of such objects, which can be modeled as a colimit in the category of RETOOL theories, is also discussed.
Abstract: This paper defines an action logic featuring an operator that denotes necessary conditions, postconditions, and time bounds of actions in a timed computational transition system. Weak completeness of an axiomatization for the logic is proved.
Abstract: This paper defines an action logic featuring an operator that denotes necessary conditions and postconditions of actions in a timed computational transition system. Three different semantics of the operator are discussed, and weak completeness is proved for one of them. It is also briefly shown how the action logic can be combined with a temporal logic to derive temporal properties of actions from the logical description of a real-time computational system.
Abstract: This paper discusses how RETOOL, an action logic featuring an operator that expresses necessary conditions, postconditions and time bounds of actions, can be combined with MTL, a linear-time temporal logic with time-bounded operators, to reason about general properties of timed transition systems, an abstract model for the behavior of objects in a real-time, object-oriented software system.
Abstract: Well-integrated development tools, allowing automatic code generation from visual representations of analysis and design decisions, are important assets in handling the complexities of today's software. This paper describes several message passing semantics for the expression of concurrency in a new object-oriented visual development system, along with the C++ idioms generated for asynchronous messages.
This file has been generated by bibtex2html 1.85.
Thu Sep 18 15:19:51 BRT 2008