Relevant bibliographies by topics / Logic and language

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Logic and language'

Author: Grafiati
Published: 4 June 2021
Last updated: 28 July 2025

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 language.'

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 language"

1

Vistrup, Max, Michael Sammler, and Ralf Jung. "Program Logics à la Carte." Proceedings of the ACM on Programming Languages 9, POPL (2025): 300–331. https://doi.org/10.1145/3704847.

Full text
Abstract:
Program logics have proven a successful strategy for verification of complex programs. By providing local reasoning and means of abstraction and composition, they allow reasoning principles for individual components of a program to be combined to prove guarantees about a whole program. Crucially, these components and their proofs can be reused. However, this reuse is only available once the program logic has been defined. It is a frustrating fact of the status quo that whoever defines a new program logic must establish every part, both semantics and proof rules, from scratch. In spite of progr
APA, Harvard, Vancouver, ISO, and other styles
2

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
3

Manca, Vincenzo. "Functional Language Logic." Electronics 14, no. 3 (2025): 460. https://doi.org/10.3390/electronics14030460.

Full text
Abstract:
The formalism of Functional Language Logic (FLL) is presented, which is an extension of a logical formalism already introduced to represent sentences in natural languages. In the FLL framework, a sentence is represented by aggregating primitive predicates corresponding to words of a fixed language (English in the given examples). The FLL formalism constitutes a bridge between mathematical logic (high-order predicate logic) and the classical logical analysis of discourse, rooted in the Western linguistic tradition. Namely, FLL representations reformulate on a rigorous logical basis many fundame
APA, Harvard, Vancouver, ISO, and other styles
4

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
5

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
6

Котикова, Е. А., 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
7

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
8

Barrio, Eduardo, and Edson Bezerra. "The logics of a universal language." Asian Journal of Philosophy 3 (February 15, 2024): a12. https://doi.org/10.1007/s44204-024-00140-3.

Full text
Abstract:
Semantic paradoxes pose a real threat to logics that attempt to be capable of expressing their own semantic concepts. Particularly, Curry paradoxes seem to show that many solutions must change our intuitive concepts of truth or validity or impose limits on certain inferences that are intuitively valid. In this way, the logic of a universal language would have serious problems. In this paper, we explore a different solution that tries to avoid both limitations as much as possible. Thus, we argue that it is possible to capture the naive concepts of truth and validity without losing any of the va
APA, Harvard, Vancouver, ISO, and other styles
9

Am, Zaimul. "Epistemology, Logic and Language (An Analysis of Logic of Language)." International Journal of Philosophy 6, no. 3 (2018): 68. http://dx.doi.org/10.11648/j.ijp.20180603.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

CARDELLI, LUCA, and GIORGIO GHELLI. "TQL: a query language for semistructured data based on the ambient logic." Mathematical Structures in Computer Science 14, no. 3 (2004): 285–327. http://dx.doi.org/10.1017/s0960129504004141.

Full text
Abstract:
The ambient logic is a modal logic that was proposed for the description of the structural and computational properties of distributed and mobile computation. The structural part of the ambient logic is, essentially, a logic of labelled trees, hence it turns out to be a good foundation for query languages for semistructured data, much in the same way as first-order logic is a fitting foundation for relational query languages. We define here a query language for semistructured data that is based on the ambient logic, and we outline an execution model for this language. The language turns out to
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Logic and language"

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

Mezzadri, Daniele. "Language and logic in Wittgenstein's Tractatus Logico-Philosophicus." Thesis, University of Stirling, 2010. http://hdl.handle.net/1893/2432.

Full text
Abstract:
This thesis discusses some central aspects of Wittgenstein’s conception of language and logic in his Tractatus Logico-Philosophicus and brings them into relation with the philosophies of Frege and Russell. The main contention is that a fruitful way of understanding the Tractatus is to see it as responding to tensions in Frege’s conception of logic and Russell’s theory of judgement. In the thesis the philosophy of the Tractatus is presented as developing from these two strands of criticism and thus as the culmination of the philosophy of logic and language developed in the early analytic period
APA, Harvard, Vancouver, ISO, and other styles
3

Eshghi, Kave. "Meta-language in logic programming." Thesis, Imperial College London, 1987. http://hdl.handle.net/10044/1/38302.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wichert, Carl-Alexander. "ULTRA - a logic transaction programming language." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=96114856X.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lucas, R. J. "A logic language as a database utility." Thesis, Coventry University, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.377552.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gally, Tom. "On the Limitations of Language and Logic." 名古屋大学教養教育院, 2013. http://hdl.handle.net/2237/21057.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

McCabe, Francis Gregory Christopher. "Logic and objects : language, application and implementation." Thesis, Imperial College London, 1989. http://hdl.handle.net/10044/1/47568.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Murakami, Yuko. "Modal logic of partitions." [Bloomington, Ind.] : Indiana University, 2005. http://wwwlib.umi.com/dissertations/fullcit/3162977.

Full text
Abstract:
Thesis (Ph.D.)--Indiana University, Dept. of Philosophy, 2005.<br>Title from PDF t.p. (viewed Dec. 2, 2008). Source: Dissertation Abstracts International, Volume: 66-02, Section: A, page: 0620. Chairs: Lawrence Moss; Michael Dunn.
APA, Harvard, Vancouver, ISO, and other styles
9

Dageförde, Jan Christoph [Verfasser], and Herbert [Akademischer Betreuer] Kuchen. "An Integrated Constraint-Logic and Object-Oriented Programming Language : The Münster Logic-Imperative Language / Jan Christoph Dageförde ; Betreuer: Herbert Kuchen." Münster : Universitäts- und Landesbibliothek Münster, 2020. http://d-nb.info/1219449806/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Collett, Guillaume. "Constructivism and language Deleuze's onto-logic of sense." Thesis, University of Kent, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.654092.

Full text
Abstract:
This thesis argues for a constructivist reading of Gilles Deleuze's early philosophy. In the introduction I outline why I consider Deleuze's philosophical project - from the 1950s to the 1990s - to centre on the problem of immanence (the "plane of immanence"), which for Deleuze is inseparable from its "construction" by various means, including language. The term "onto-logic" is used to capture this notion of immanence as constructed by language, and I claim that "univocal sense" is the name of this immanence during Deleuze' s 1960s works. In Part I, I then show in detail how Deleuze derives hi
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Logic and language"

1

Ayer, A. J. Language, truth & logic. Penguin Books Ltd., 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dean, Neville. Logic and Language. Macmillan Education UK, 2003. http://dx.doi.org/10.1007/978-0-230-00605-8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wybraniec-Skardowska, Urszula B. Logic - Language - Ontology. Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-22330-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ś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
5

Dean, Neville. Logic and language. Palgrave Macmillan, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Norris, Christopher. Language, Logic and Epistemology. Palgrave Macmillan UK, 2004. http://dx.doi.org/10.1057/9780230512368.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Özgün, Aybüke, and Yulia Zinova, eds. Language, Logic, and Computation. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-98479-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shapiro, Michael. The Logic of Language. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-06612-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aloni, Maria, Harald Bastiaanse, Tikitu de Jager, and Katrin Schulz, eds. Logic, Language and Meaning. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14287-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bosch, Peter, David Gabelaia, and Jérôme Lang, eds. Logic, Language, and Computation. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00665-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Logic and language"

1

Li, Wei. "Meta-Language Environments." In Mathematical Logic. Springer Basel, 2014. http://dx.doi.org/10.1007/978-3-0348-0862-0_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dean, Neville. "Predicate Logic." In Logic and Language. Macmillan Education UK, 2003. http://dx.doi.org/10.1007/978-0-230-00605-8_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Steinhart, Eric Charles. "Language." In The Logic of Metaphor. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-015-9654-1_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Waldron, T. P. "Logic." In Principles of Language and Mind. Routledge, 2025. https://doi.org/10.4324/9781003665816-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shekhar, Shashi, and Hui Xiong. "Logic Programming Language." In Encyclopedia of GIS. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_726.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Weik, Martin H. "logic programming language." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_10597.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Demont-Biaggi, Florian. "Logic and Language." In Rules and Dispositions in Language Use. Palgrave Macmillan UK, 2014. http://dx.doi.org/10.1057/9781137358608_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Agassi, Joseph. "Logic and Language." In Ludwig Wittgenstein’s Philosophical Investigations. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00117-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Cohen, Elliot D. "Logic and Language." In Cognitive-Behavior Interventions for Self-Defeating Thoughts. Routledge, 2021. http://dx.doi.org/10.4324/9781003026730-1-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Parikh, Rohit. "Logic Without Language." In Logic and Its Applications. Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-58771-3_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Logic and language"

1

T, Saffron Dionysius, Rakesh G, and Jasmine Mystica K. "AI Circuit Builder: Bridging Language & Logic." In 2025 International Conference on Visual Analytics and Data Visualization (ICVADV). IEEE, 2025. https://doi.org/10.1109/icvadv63329.2025.10960965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Neuman, W. Russell, Chad Coleman, Manan Shah, and Ali Dasdan. "Ethical Logic in Six Large Language Models." In 2025 IEEE Conference on Artificial Intelligence (CAI). IEEE, 2025. https://doi.org/10.1109/cai64502.2025.00052.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mao, Yuchen, Tianci Zhang, Xu Cao, et al. "NL2STL: Transformation from Logic Natural Language to Signal Temporal Logics using Llama2." In 2024 IEEE International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE International Conference on Robotics, Automation and Mechatronics (RAM). IEEE, 2024. http://dx.doi.org/10.1109/cis-ram61939.2024.10672997.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Han, Simeng, Hailey Schoelkopf, Yilun Zhao, et al. "FOLIO: Natural Language Reasoning with First-Order Logic." In Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.emnlp-main.1229.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Liu, Tongxuan, Wenjiang Xu, Weizhe Huang, et al. "Logic-of-Thought: Injecting Logic into Contexts for Full Reasoning in Large Language Models." In Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). Association for Computational Linguistics, 2025. https://doi.org/10.18653/v1/2025.naacl-long.510.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Arenas, Marcelo, Pablo Barceló, Diego Bustamante, Jose Caraball, and Bernardo Subercaseaux. "A Uniform Language to Explain Decision Trees." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/6.

Full text
Abstract:
The formal XAI community has studied a plethora of interpretability queries aiming to understand the classifications made by decision trees. However, a more uniform understanding of what questions we can hope to answer about these models, traditionally deemed to be easily interpretable, has remained elusive. In an initial attempt to understand uniform languages for interpretability, Arenas et al. proposed FOIL, a logic for explaining black-box ML models, and showed that it can express a variety of interpretability queries. However, we show that FOIL is limited in two important senses: (i) it i
APA, Harvard, Vancouver, ISO, and other styles
7

Weir, Nathaniel, Kate Sanders, Orion Weller, et al. "Enhancing Systematic Decompositional Natural Language Inference Using Informal Logic." In Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.emnlp-main.531.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhang, Zongmeng, Jinhua Zhu, Wengang Zhou, Xiang Qi, Peng Zhang, and Houqiang Li. "BoolQuestions: Does Dense Retrieval Understand Boolean Logic in Language?" In Findings of the Association for Computational Linguistics: EMNLP 2024. Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.findings-emnlp.156.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yang, Yuan, Siheng Xiong, Ali Payani, Ehsan Shareghi, and Faramarz Fekri. "Harnessing the Power of Large Language Models for Natural Language to First-Order Logic Translation." In Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Association for Computational Linguistics, 2024. http://dx.doi.org/10.18653/v1/2024.acl-long.375.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Reports on the topic "Logic and language"

1

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
2

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
3

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
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

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
6

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
7

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
8

Zarrieß, Benjamin, and Jens Claßen. Verification of Knowledge-Based Programs over Description Logic Actions. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.216.

Full text
Abstract:
A knowledge-based program defines the behavior of an agent by combining primitive actions, programming constructs and test conditions that make explicit reference to the agent’s knowledge. In this paper we consider a setting where an agent is equipped with a Description Logic (DL) knowledge base providing general domain knowledge and an incomplete description of the initial situation. We introduce a corresponding new DL-based action language that allows for representing both physical and sensing actions, and that we then use to build knowledge-based programs with test conditions expressed in t
APA, Harvard, Vancouver, ISO, and other styles
9

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
10

Baader, Franz, Conrad Drescher, Hongkai Liu, et al. Putting ABox Updates into Action. Technische Universität Dresden, 2009. http://dx.doi.org/10.25368/2022.170.

Full text
Abstract:
When trying to apply recently developed approaches for updating Description Logic ABoxes in the context of an action programming language, one encounters two problems. First, updates generate so-called Boolean ABoxes, which cannot be handled by traditional Description Logic reasoners. Second, iterated update operations result in very large Boolean ABoxes, which, however, contain a huge amount of redundant information. In this paper, we address both issues from a practical point of view.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Logic and language' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography