Log in

Relevant bibliographies by topics / Logic and languages

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Logic and languages'

Author: Grafiati

Published: 4 June 2021

Last updated: 31 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Logic and languages.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Logic and languages"

1

Fillotrani, Pablo, and C. Maria Keet. "Evidence-based lean conceptual data modelling languages." Journal of Computer Science and Technology 21, no. 2 (2021): e10. http://dx.doi.org/10.24215/16666038.21.e10.

Full text

Abstract:

Multiple logic-based reconstructions of conceptual data modelling languages such as EER, UML Class Diagrams, and ORM exist. They mainly cover various fragments of the languages and none are formalised such that the logic applies simultaneously for all three modelling language families as unifying mechanism. This hampers interchangeability, interoperability, and tooling support. In addition, due to the lack of a systematic design process of the logic used for the formalisation, hidden choices permeate the formalisations that have rendered them incompatible. We aim to address these problems, fir

APA, Harvard, Vancouver, ISO, and other styles

2

Peñaloza, Rafael. "A Brief Roadmap into Uncertain Knowledge Representation via Probabilistic Description Logics." Algorithms 14, no. 10 (2021): 280. http://dx.doi.org/10.3390/a14100280.

Full text

Abstract:

Logic-based knowledge representation is one of the main building blocks of (logic-based) artificial intelligence. While most successful knowledge representation languages are based on classical logic, realistic intelligent applications need to handle uncertainty in an adequate manner. Over the years, many different languages for representing uncertain knowledge—often extensions of classical knowledge representation languages—have been proposed. We briefly present some of the defining properties of these languages as they pertain to the family of probabilistic description logics. This limited v

APA, Harvard, Vancouver, ISO, and other styles

3

Goguadze, George, Carla Piazza, and Yde Venema. "Simulating polyadic modal logics by monadic ones." Journal of Symbolic Logic 68, no. 2 (2003): 419–62. http://dx.doi.org/10.2178/jsl/1052669058.

Full text

Abstract:

AbstractWe define an interpretation of modal languages with polyadic operators in modal languages that use monadic operators (diamonds) only. We also define a simulation operator which associates a logic Λsim in the diamond language with each logic Λ in the language with polyadic modal connectives. We prove that this simulation operator transfers several useful properties of modal logics, such as finite/recursive axiomatizability, frame completeness and the finite model property, canonicity and first-order definability.

APA, Harvard, Vancouver, ISO, and other styles

4

Artale, A., and E. Franconi. "A Temporal Description Logic for Reasoning about Actions and Plans." Journal of Artificial Intelligence Research 9 (December 1, 1998): 463–506. http://dx.doi.org/10.1613/jair.516.

Full text

Abstract:

A class of interval-based temporal languages for uniformly representing and reasoning about actions and plans is presented. Actions are represented by describing what is true while the action itself is occurring, and plans are constructed by temporally relating actions and world states. The temporal languages are members of the family of Description Logics, which are characterized by high expressivity combined with good computational properties. The subsumption problem for a class of temporal Description Logics is investigated and sound and complete decision procedures are given. The basic lan

APA, Harvard, Vancouver, ISO, and other styles

5

Котикова, Е. А., and М. Н. Рыбаков. "Kripke Incompleteness of First-order Calculi with Temporal Modalities of CTL and Near Logics." Logical Investigations 21, no. 1 (2015): 86–99. http://dx.doi.org/10.21146/2074-1472-2015-21-1-86-99.

Full text

Abstract:

We study an expressive power of temporal operators used in such logics of branching time as computational tree logic or alternating-time temporal logic. To do this we investigate calculi in the first-order language enriched with the temporal operators used in such logics. We show that the resulting languages are so powerful that many ‘natural’ calculi in the languages are not Kripke complete; for example, if a calculus in such language is correct with respect to the class of all serial linear Kripke frames (even just with constant domains) then it is not Kripke complete. Some near questions ar

APA, Harvard, Vancouver, ISO, and other styles

6

Calvanese, Diego, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Vardi. "Node Selection Query Languages for Trees." Proceedings of the AAAI Conference on Artificial Intelligence 24, no. 1 (2010): 279–84. http://dx.doi.org/10.1609/aaai.v24i1.7598.

Full text

Abstract:

The study of node-selection query languages for (finite) trees has been a major topic in the recent research on query lan- guages for Web documents. On one hand, there has been an extensive study of XPath and its various extensions. On the other hand, query languages based on classical logics, such as first-order logic (FO) or monadic second-order logic (MSO), have been considered. Results in this area typically relate an Xpath-based language to a classical logic. What has yet to emerge is an XPath-related language that is expressive as MSO, and at the same time enjoys the computational proper

APA, Harvard, Vancouver, ISO, and other styles

7

Crain, Stephen, and Drew Khlentzos. "Is Logic Innate?" Biolinguistics 2, no. 1 (2008): 024–56. http://dx.doi.org/10.5964/bioling.8619.

Full text

Abstract:

Arguments are presented supporting logical nativism: the conjecture that humans have an innate logic faculty. In making a case for logical nativism, this article concentrates on children’s acquisition of the logical concept of disjunction. Despite the widespread belief to the contrary, the interpretation of disjunction in human languages is arguably the same as it is in classical logic, namely inclusive–or. The argument proceeds with empirical support for the view that the inclusive–or is the meaning of disjunction in human languages, from studies of child language development and from cross-l

APA, Harvard, Vancouver, ISO, and other styles

8

Боброва, Ангелина Сергеевна. "Iconicity of logic and iconicity in logic." Логико-философские штудии, no. 3 (November 30, 2022): 250–53. http://dx.doi.org/10.52119/lphs.2022.69.40.001.

Full text

Abstract:

Логические теории не могут быть построены без формального языка, основу которого задают символы. Однако это не говорит о том, что логика (в целом) может работать только на уровне языка. Через язык логика лишь выражается. Это уточнение позволяет пересмотреть природу логических знаков, то есть составных единиц языка. Будет показано, что основу логических языков должны задавать знаки-иконы. Для этого будут проанализированы различные виды икон, рассмотрена природа иконического и ее несводимость к визуальному, а также уточнена роль иконического для понимания предмета логики и ее возможностей. Logic

APA, Harvard, Vancouver, ISO, and other styles

9

Martínez-Fernández, José, and Genoveva Martí. "The representation of gappy sentences in four-valued semantics." Semiotica 2021, no. 240 (2021): 145–63. http://dx.doi.org/10.1515/sem-2021-0011.

Full text

Abstract:

Abstract Three-valued logics are standardly used to formalize gappy languages, i.e., interpreted languages in which sentences can be true, false or neither. A three-valued logic that assigns the same truth value to all gappy sentences is, in our view, insufficient to capture important semantic differences between them. In this paper we will argue that there are two different kinds of pathologies that should be treated separately and we defend the usefulness of a four-valued logic to represent adequately these two types of gappy sentences. Our purpose is to begin the formal exploration of the f

APA, Harvard, Vancouver, ISO, and other styles

10

Lin, Zhe, and Minghui Ma. "Gentzen sequent calculi for some intuitionistic modal logics." Logic Journal of the IGPL 27, no. 4 (2019): 596–623. http://dx.doi.org/10.1093/jigpal/jzz020.

Full text

Abstract:

Abstract Intuitionistic modal logics are extensions of intuitionistic propositional logic with modal axioms. We treat with two modal languages ${\mathscr{L}}_\Diamond $ and $\mathscr{L}_{\Diamond ,\Box }$ which extend the intuitionistic propositional language with $\Diamond $ and $\Diamond ,\Box $, respectively. Gentzen sequent calculi are established for several intuitionistic modal logics. In particular, we introduce a Gentzen sequent calculus for the well-known intuitionistic modal logic $\textsf{MIPC}$. These sequent calculi admit cut elimination and subformula property. They are decidable

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Logic and languages"

1

Cook, Jonathan J. "Language interoperability and logic programming languages." Thesis, University of Edinburgh, 2005. http://hdl.handle.net/1842/725.

Full text

Abstract:

We discuss P#, our implementation of a tool which allows interoperation between a concurrent superset of the Prolog programming language and C#. This enables Prolog to be used as a native implementation language for Microsoft's .NET platform. P# compiles a linear logic extension of Prolog to C# source code. We can thus create C# objects from Prolog and use C#'s graphical, networking and other libraries. P# was developed from a modified port of the Prolog to Java translator, Prolog Cafe. We add language constructs on the Prolog side which allow concurrent Prolog code to be written. We add a pri

APA, Harvard, Vancouver, ISO, and other styles

2

Ishiura, Nagisa. "Studies on Logic Simulation and Hardware Description Languages." Kyoto University, 1990. http://hdl.handle.net/2433/74578.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Delaney, Aidan. "Defining star-free regular languages using diagrammatic logic." Thesis, University of Brighton, 2012. https://research.brighton.ac.uk/en/studentTheses/d1c53bda-f520-4807-9de9-8de12eda3d9e.

Full text

Abstract:

Spider diagrams are a recently developed visual logic that make statements about relationships between sets, their members and their cardinalities. By contrast, the study of regular languages is one of the oldest active branches of computer science research. The work in this thesis examines the previously unstudied relationship between spider diagrams and regular languages. In this thesis, the existing spider diagram logic and the underlying semantic theory is extended to allow direct comparison of spider diagrams and star-free regular languages. Thus it is established that each spider diagram

APA, Harvard, Vancouver, ISO, and other styles

4

Bowers, Antony Francis. "Effective meta-programming in declarative languages." Thesis, University of Bristol, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.263891.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Wright, David A. "An integration of reduction and logic for programming languages." Thesis, Rhodes University, 1988. http://hdl.handle.net/10962/d1002035.

Full text

Abstract:

A new declarative language is presented which captures the expressibility of both logic programming languages and functional languages. This is achieved by conditional graph rewriting, with full unification as the parameter passing mechanism. The syntax and semantics are described both formally and informally, and examples are offered to support the expressibility claim made above. The language design is of further interest due to its uniformity and the inclusion of a novel mechanism for type inference in the presence of derived type hierarchies

APA, Harvard, Vancouver, ISO, and other styles

6

Priestley, P. M. "Logic and the development of programming languages, 1930-1975." Thesis, University College London (University of London), 2008. http://discovery.ucl.ac.uk/1446167/.

Full text

Abstract:

Compared with the history' of computing hardware, the history of software is in a relatively unde veloped state. In particular, the history of programming languages still consists for the most part of technical accounts presenting a rather Whiggish perspective on developments. Given the importance of software in the contemporary world, however, it is important to develop a more sophisticated un derstanding of the medium in which it is expressed. This thesis considers some aspects of this history with the aim of examining the influence of formal logic on the evolution of notations for expressin

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Tzone I. "Distributed object oriented logic programming." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296891.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Sadeghi, Parisa Haj [Verfasser]. "Run-time debugging for functional logic languages / Parisa Haj Sadeghi." Kiel : Universitätsbibliothek Kiel, 2010. http://d-nb.info/1019984961/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Crammond, James Alexander. "Implementation of committed choice logic languages on shared memory multiprocessors." Thesis, Heriot-Watt University, 1988. http://hdl.handle.net/10399/971.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Papadopoulos, George Angelos. "Parallel implementation of concurrent logic languages using graph rewriting techniques." Thesis, University of East Anglia, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.329340.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Logic and languages"

1

Święczkowska, Halina. Logic, language, methodology. Chair of Logic, Informatics and Philosophy of Science, University of Białystok, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hoare, C. A. R. 1934- and Shepherdson J. C, eds. Mathematical logic and programming languages. Prentice/Hall International, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Parkes, Alan P. Introduction to languages, machines and logic: Computable languages, abstract machines and formal logic. Springer, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Parkes, Alan P. Introduction to Languages, Machines and Logic: Computable Languages, Abstract Machines and Formal Logic. Springer London, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Introduction to languages, machines and logic: Computable languages, abstract machines and formal logic. Springer, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Guttenplan, Samuel. The languages of logic: An introduction to formal logic. Basil Blackwell, 1986.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Guttenplan, Samuel D. The Languages of Logic: An Introduction to Formal Logic. 2nd ed. Blackwell Publishers, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

M, Ellis John. Language, thought, and logic. Northwestern University Press, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Guttenplan, Samuel D. The languages of logic: An introduction. Blackwell, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Radev, Dragomir, ed. Puzzles in Logic, Languages and Computation. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-34372-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Logic and languages"

1

Dongarra, Jack, Piotr Luszczek, Paul Feautrier, et al. "Logic Languages." In Encyclopedia of Parallel Computing. Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_116.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Makridis, Odysseus. "Sentential Logic Languages ∑." In Symbolic Logic. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-67396-3_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Goubault-Larrecq, Jean, and Ian Mackie. "Logic Programming Languages." In Applied Logic Series. Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-011-3981-6_10.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Steele, Guy L., Xiaowei Shen, Josep Torrellas, et al. "Concurrent Logic Languages." In Encyclopedia of Parallel Computing. Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_2208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Falsafi, Babak, Samuel Midkiff, JackB Dennis, et al. "Distributed Logic Languages." In Encyclopedia of Parallel Computing. Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_2209.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Wilhelm, Reinhard, and Helmut Seidl. "Logic Programming Languages." In Compiler Design. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14909-2_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Csirmaz, Laszlo, and Zalán Gyenis. "Formal Languages and Automata." In Mathematical Logic. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-79010-3_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Lee, Kent D. "Logic Programming." In Foundations of Programming Languages. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70790-7_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ebbinghaus, H. D., J. Flum, and W. Thomas. "Syntax of First-Order Languages." In Mathematical Logic. Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4757-2355-7_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ebbinghaus, H. D., J. Flum, and W. Thomas. "Semantics of First-Order Languages." In Mathematical Logic. Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4757-2355-7_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Logic and languages"

1

Schwering, Christoph. "A Reasoning System for a First-Order Logic of Limited Belief." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/173.

Full text

Abstract:

Logics of limited belief aim at enabling computationally feasible reasoning in highly expressive representation languages. These languages are often dialects of first-order logic with a weaker form of logical entailment that keeps reasoning decidable or even tractable. While a number of such logics have been proposed in the past, they tend to remain for theoretical analysis only and their practical relevance is very limited. In this paper, we aim to go beyond the theory. Building on earlier work by Liu, Lakemeyer, and Levesque, we develop a logic of limited belief that is highly expressive but

APA, Harvard, Vancouver, ISO, and other styles

2

Cox, Philip, Andrew Fish, and John Howse. "Visual Languages and Logic." In IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC 2007). IEEE, 2007. http://dx.doi.org/10.1109/vlhcc.2007.56.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Huntbach, Matthew. "Search in concurrent logic languages." In the 1995 ACM symposium. ACM Press, 1995. http://dx.doi.org/10.1145/315891.315947.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

JAIN, SANJAY, and EFIM KINBER. "NEGATIVE DATA IN LEARNING LANGUAGES." In Proceedings of the 9th Asian Logic Conference. WORLD SCIENTIFIC, 2006. http://dx.doi.org/10.1142/9789812772749_0008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Kahn, Kenneth, Eric Dean Tribble, Mark S. Miller, and Daniel G. Bobrow. "Objects in concurrent logic programming languages." In the 1986 SIGPLAN workshop. ACM Press, 1986. http://dx.doi.org/10.1145/323779.323739.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kahn, Kenneth, Eric Dean Tribble, Mark S. Miller, and Daniel G. Bobrow. "Objects in concurrent logic programming languages." In Conference proceedings. ACM Press, 1986. http://dx.doi.org/10.1145/28697.28721.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Vafeiadis, Viktor. "Separation logic for weak memory models." In the Programming Languages Mentoring Workshop. ACM Press, 2015. http://dx.doi.org/10.1145/2792434.2792445.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Carayol, Arnaud, Axel Hadda, and Olivier Serre. "Qualitative Tree Languages." In 2011 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011). IEEE, 2011. http://dx.doi.org/10.1109/lics.2011.28.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kopczyński, Eryk. "Invisible Pushdown Languages." In LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. ACM, 2016. http://dx.doi.org/10.1145/2933575.2933579.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Gollapudi, Chandra, and Dawn Tilbury. "Logic Control Design and Implementation for a Machining Line Testbed Using Petri Nets." In ASME 2001 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/imece2001/dsc-24594.

Full text

Abstract:

Abstract Historically, logic control for machining systems has been programmed in ladder logic. Although this language is very intuitive at a low level, it is difficult to understand the sequencing in a large and complex program. Recently, several different formal languages, such as Petri nets, finite state machines, and real-time temporal logic, have been proposed for logic control design. These languages allow the logic to be formally verified to be correct before it is implemented. The proofs of correctness rely on a set of explicit and implicit assumptions. By implementing these methods on

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Logic and languages"

1

Baader, Franz, and Ralf Küsters. Unification in a Description Logic with Transitive Closure of Roles. Aachen University of Technology, 2001. http://dx.doi.org/10.25368/2022.115.

Full text

Abstract:

Unification of concept descriptions was introduced by Baader and Narendran as a tool for detecting redundancies in knowledge bases. It was shown that unification in the small description logic FL₀, which allows for conjunction, value restriction, and the top concept only, is already ExpTime-complete. The present paper shows that the complexity does not increase if one additionally allows for composition, union, and transitive closure of roles. It also shows that matching (which is polynomial in FL₀) is PSpace-complete in the extended description logic. These results are proved via a reduction

APA, Harvard, Vancouver, ISO, and other styles

2

Baader, Franz, and Benjamin Zarrieß. Verification of Golog Programs over Description Logic Actions. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.198.

Full text

Abstract:

High-level action programming languages such as Golog have successfully been used to model the behavior of autonomous agents. In addition to a logic-based action formalism for describing the environment and the effects of basic actions, they enable the construction of complex actions using typical programming language constructs. To ensure that the execution of such complex actions leads to the desired behavior of the agent, one needs to specify the required properties in a formal way, and then verify that these requirements are met by any execution of the program. Due to the expressiveness of

APA, Harvard, Vancouver, ISO, and other styles

3

Lutz, Carsten, Dirk Walther, and Frank Wolter. Quantitative Temporal Logics: PSpace and below. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2022.146.

Full text

Abstract:

Often the addition of metric operators to qualitative temporal logics leads to an increase of the complexity of satisfiability by at least one exponential. In this paper, we exhibit a number of metric extensions of qualitative temporal logics of the real line that do not lead to an increase in computational complexity. The main result states that the language obtained by extending since/until logic of the real line with the operators 'sometime within n time units', n coded in binary, is PSpace-complete even without the finite variability assumption. Without qualitative temporal operators the c

APA, Harvard, Vancouver, ISO, and other styles

4

Borgwardt, Stefan, and Veronika Thost. Temporal Query Answering in DL-Lite with Negation. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.221.

Full text

Abstract:

Ontology-based query answering augments classical query answering in databases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We investigate temporal query answering w.r.t. ontologies formulated in DL-Lite, a family of description logics that captures the conceptual features of relational databases and was tailored for efficient query answering. We consider a recently proposed temporal query language that combines conjunctive queries with the operators of propositional linear temporal logic (LTL). In particular, we consider negation in the onto

APA, Harvard, Vancouver, ISO, and other styles

5

Borgwardt, Stefan, Marco Cerami, and Rafael Peñaloza. Subsumption in Finitely Valued Fuzzy EL. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.212.

Full text

Abstract:

Aus der Einleitung: Description Logics (DLs) are a family of knowledge representation formalisms that are successfully applied in many application domains. They provide the logical foundation for the Direct Semantics of the standard web ontology language OWL2. The light-weight DL EL, underlying the OWL2 EL profile, is of particular interest since all common reasoning problems are polynomial in this logic, and it is used in many prominent biomedical ontologies like SNOMEDCT and the Gene Ontology.

APA, Harvard, Vancouver, ISO, and other styles

6

Baader, Franz, Pavlos Marantidis, and Alexander Okhotin. Approximate Unification in the Description Logic FL₀. Technische Universität Dresden, 2016. http://dx.doi.org/10.25368/2022.228.

Full text

Abstract:

Unification in description logics (DLs) has been introduced as a novel inference service that can be used to detect redundancies in ontologies, by finding different concepts that may potentially stand for the same intuitive notion. It was first investigated in detail for the DL FL₀, where unification can be reduced to solving certain language equations. In order to increase the recall of this method for finding redundancies, we introduce and investigate the notion of approximate unification, which basically finds pairs of concepts that “almost” unify. The meaning of “almost” is formalized usin

APA, Harvard, Vancouver, ISO, and other styles

7

Borgwardt, Stefan, Marcel Lippmann, and Veronika Thost. Temporal Query Answering w.r.t. DL-Lite-Ontologies. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.195.

Full text

Abstract:

Ontology-based data access (OBDA) generalizes query answering in relational databases. It allows to query a database by using the language of an ontology, abstracting from the actual relations of the database. For ontologies formulated in Description Logics of the DL-Lite family, OBDA can be realized by rewriting the query into a classical first-order query, e.g. an SQL query, by compiling the information of the ontology into the query. The query is then answered using classical database techniques. In this report, we consider a temporal version of OBDA. We propose a temporal query language th

APA, Harvard, Vancouver, ISO, and other styles

8

Baader, Franz, and Barbara Morawska. SAT Encoding of Unification in EL. Technische Universität Dresden, 2010. http://dx.doi.org/10.25368/2022.177.

Full text

Abstract:

The Description Logic EL is an inexpressive knowledge representation language, which nevertheless has recently drawn considerable attention in the knowledge representation and the ontology community since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies. Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. In a recent paper, we have shown that unification in EL is NP-complete, and thus

APA, Harvard, Vancouver, ISO, and other styles

9

Baader, Franz. Terminological cycles in a description logic with existential restrictions. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.120.

Full text

Abstract:

Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language FL₀, which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This report investigates subsumption in the presence of terminological cycles for the language EL, which allows for conjunction and existential restrictions. In contrast to the results for FL₀, subsumption in EL remains polynomial, independent of wether we use least fixpoint s

APA, Harvard, Vancouver, ISO, and other styles

10

Baader, Franz, and Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.

Full text

Abstract:

An abridged version of this technical report has been submitted to KR 2000. Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the CLASSIC system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. Motivated by an application in chemical process engineering, which requires a description language with existential restrictions, this paper investigates the matching problem in Description Logics with exi

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!