Log in

Relevant bibliographies by topics / Logic expression

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Logic expression'

Author: Grafiati

Published: 5 June 2025

Last updated: 15 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 expression.'

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

1

Rönnedal, Daniel. "Boulesic-Doxastic Logic." Australasian Journal of Logic 16, no. 3 (2019): 83. http://dx.doi.org/10.26686/ajl.v16i3.4158.

Full text

Abstract:

In this paper, I will develop a set of boulesic-doxastic tableau systems and prove that they are sound and complete. Boulesic-doxastic logic consists of two main parts: a boulesic part and a doxastic part. By ‘boulesic logic’ I mean ‘the logic of the will’, and by ‘doxastic logic’ I mean ‘the logic of belief’. The first part deals with ‘boulesic’ concepts, expressions, sentences, arguments and theorems. I will concentrate on two types of boulesic expression: ‘individual x wants it to be the case that’ and ‘individual x accepts that it is the case that’. The second part deals with ‘doxastic’ co

APA, Harvard, Vancouver, ISO, and other styles

2

Sain, Barbara K. "Expression in the Theo-Logic." Philosophy and Theology 19, no. 1 (2007): 301–22. http://dx.doi.org/10.5840/philtheol2007191/216.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Mora-Martinez, Carlos. "Expression pattern determines regulatory logic." PLOS ONE 16, no. 1 (2021): e0244864. http://dx.doi.org/10.1371/journal.pone.0244864.

Full text

Abstract:

Large amounts of effort have been invested in trying to understand how a single genome is able to specify the identity of hundreds of cell types. Inspired by some aspects of Caenorhabditis elegans biology, we implemented an in silico evolutionary strategy to produce gene regulatory networks (GRNs) that drive cell-specific gene expression patterns, mimicking the process of terminal cell differentiation. Dynamics of the gene regulatory networks are governed by a thermodynamic model of gene expression, which uses DNA sequences and transcription factor degenerate position weight matrixes as input.

APA, Harvard, Vancouver, ISO, and other styles

4

Scott, Joseph, Maysum Panju, and Vijay Ganesh. "LGML: Logic Guided Machine Learning (Student Abstract)." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 10 (2020): 13909–10. http://dx.doi.org/10.1609/aaai.v34i10.7227.

Full text

Abstract:

We introduce Logic Guided Machine Learning (LGML), a novel approach that symbiotically combines machine learning (ML) and logic solvers to learn mathematical functions from data. LGML consists of two phases, namely a learning-phase and a logic-phase with a corrective feedback loop, such that, the learning-phase learns symbolic expressions from input data, and the logic-phase cross verifies the consistency of the learned expression with known auxiliary truths. If inconsistent, the logic-phase feeds back "counterexamples" to the learning-phase. This process is repeated until the learned expressi

APA, Harvard, Vancouver, ISO, and other styles

5

GOVERNATORI, GUIDO, and MICHAEL J. MAHER. "Annotated defeasible logic." Theory and Practice of Logic Programming 17, no. 5-6 (2017): 819–36. http://dx.doi.org/10.1017/s1471068417000266.

Full text

Abstract:

AbstractDefeasible logics provide several linguistic features to support the expression of defeasible knowledge. There is also a wide variety of such logics, expressing different intuitions about defeasible reasoning. However, the logics can only combine in trivial ways. This limits their usefulness in contexts where different intuitions are at play in different aspects of a problem. In particular, in some legal settings, different actors have different burdens of proof, which might be expressed as reasoning in different defeasible logics. In this paper, we introduce annotated defeasible logic

APA, Harvard, Vancouver, ISO, and other styles

6

Schilstra, Maria J., and Chrystopher L. Nehaniv. "Bio-Logic: Gene Expression and the Laws of Combinatorial Logic." Artificial Life 14, no. 1 (2008): 121–33. http://dx.doi.org/10.1162/artl.2008.14.1.121.

Full text

Abstract:

At the heart of the development of fertilized eggs into fully formed organisms and the adaptation of cells to changed conditions are genetic regulatory networks (GRNs). In higher multicellular organisms, signal selection and multiplexing are performed at the cis-regulatory domains of genes, where combinations of transcription factors (TFs) regulate the rates at which the genes are transcribed into mRNA. To be able to act as activators or repressors of gene transcription, TFs must first bind to target sequences on the regulatory domains. Two TFs that act in concert may bind entirely independent

APA, Harvard, Vancouver, ISO, and other styles

7

Welles, James. "A Limit on Logic." Journal of Clinical Research and Reports 8, no. 3 (2021): 01. http://dx.doi.org/10.31579/2690-1919/176.

Full text

Abstract:

One of the problems with logic is that it cannot be self-refuting–if it is, it is not logical. This make logic its own sacred cow. It likewise makes the expression “By logical extension” irrelevant or at least suspect in a curved universe. One may extend logic, but even after one step, its use is dubious at best.

APA, Harvard, Vancouver, ISO, and other styles

8

Spies, Simon, Niklas Mück, Haoyi Zeng, et al. "Destabilizing Iris." Proceedings of the ACM on Programming Languages 9, PLDI (2025): 848–73. https://doi.org/10.1145/3729284.

Full text

Abstract:

The separation logic framework Iris has been built on the premise that all assertions are stable , meaning they unconditionally enjoy the famous frame rule . This gives Iris—and the numerous program logics that build on it—very modular reasoning principles. But stability also comes at a cost. It excludes a core feature of the Viper verifier family, heap-dependent expression assertions , which lift program expressions to the assertion level in order to reduce redundancy between code and specifications and better facilitate SMT-based automation. In this paper, we bring heap-dependent expression

APA, Harvard, Vancouver, ISO, and other styles

9

Cheng, Daizhan, and Zhiqiang Li. "Solving logic equation via matrix expression." Frontiers of Electrical and Electronic Engineering in China 4, no. 3 (2009): 259–69. http://dx.doi.org/10.1007/s11460-009-0040-z.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Cheng, Guang Zhen, and Yuan Bo Cheng. "Electrical Control System Designing Based on Logic Relation Chart." Advanced Materials Research 201-203 (February 2011): 2338–42. http://dx.doi.org/10.4028/www.scientific.net/amr.201-203.2338.

Full text

Abstract:

Based on working flow and control demand for figuration machine of the grinding material, a work process sketch map is drawn. According to the logic design method and step of electrical control circuitry, a logic relation chart can be finished. Considering basic logic adaptable condition of relay expression, operation component work zone must be arranged reasonably and operation component logic expression must be expressed clearly and then the operation component logic expression can be ultimately converted into equivalent electrical control circuit diagram so as to realize control requirement

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Logic expression"

1

Reynolds, Robert. "Gene Expression Data Analysis Using Fuzzy Logic." Fogler Library, University of Maine, 2001. http://www.library.umaine.edu/theses/pdf/REynoldsR2001.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Moore, S. J. "The regulatory logic of Pax3 expression in the neural tube." Thesis, University College London (University of London), 2012. http://discovery.ucl.ac.uk/1370636/.

Full text

Abstract:

The development of complex tissues is dependent on the specification and maintenance of distinct transcriptional identities within populations of equivalent progenitors. In the vertebrate neural tube, progenitor identity is specified by the spatially organised expression of transcription factors within the dorso-ventral (DV) axis of the tissue. A series of selective cross-repressive interactions between transcription factors expressed in adjacent domains forms the basis of a gene regulatory network (GRN), which acts to define and maintain the boundaries between progenitor populations. Pax3 is

APA, Harvard, Vancouver, ISO, and other styles

3

Selpi. "An inductive logic programming approach to learning which uORFs regulate gene expression." Thesis, Robert Gordon University, 2008. http://hdl.handle.net/10059/224.

Full text

Abstract:

Some upstream open reading frames (uORFs) regulate gene expression (i.e. they are functional) and can play key roles in keeping organisms healthy. However, how uORFs are involved in gene regulation is not het fully understood. In order to get a complete view of how uORFs are involved in gene regulation, it is expected that a large number of functional uORFs are needed. Unfortunately , lab experiments to verify that uORFs are functional are expensive. In this thesis, for the first time, the use of inductive logic programming (ILP) is explored for the task of learning which uORFs regulate gene e

APA, Harvard, Vancouver, ISO, and other styles

4

Santos, Patrick John. "Facial Expression Cloning with Fuzzy Membership Functions." Thèse, Université d'Ottawa / University of Ottawa, 2013. http://hdl.handle.net/10393/26260.

Full text

Abstract:

This thesis describes the development and experimental results of a system to explore cloning of facial expressions between dissimilar face models, so new faces can be animated using the animations from existing faces. The system described in this thesis uses fuzzy membership functions and subtractive clustering to represent faces and expressions in an intermediate space. This intermediate space allows expressions for face models with different resolutions to be compared. The algorithm is trained for each pair of faces using particle swarm optimization, which selects appropriate weights and ra

APA, Harvard, Vancouver, ISO, and other styles

5

Shafiei, Mohammad. "Signification et Intentionnalité : une approche dialogique." Thesis, Paris 1, 2017. http://www.theses.fr/2017PA01H202.

Full text

Abstract:

Ce travail contient une investigation sur la théorie phénoménologique de la signification. L'idée-clé du projet est d'expliquer la constitution de la signification au moyen des analyses de l'intentionnalité. Nous avons étudié différents actes intentionnels qui fonctionnent dans l'expression et dans la construction des significations. Nous avons étudié à cet égard, d'abord, l'acte d'expression primordiale, dans lequel le contenu d'une intuition est élevé au domaine de l'idéal, puis les actes de synthèse catégorielle, dans lesquels d'autres significations se constituent en absence de leur propre

APA, Harvard, Vancouver, ISO, and other styles

6

Mutňanský, Filip. "Ověřování parametrických vlastností nad záznamy běhů programů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417229.

Full text

Abstract:

The goal of this thesis is to implement a tool that based on user defined properties can verify sequences of events in the traces of the program, or the log file. Properties are defined in extended regular expressions. The tool is able to verify parametric properties. User can define relations between parameters of events. Input of this tool is the definition of properties and constraints of parameters. Output of the tool is the report of violated properties with its sequences of events that caused the error.

APA, Harvard, Vancouver, ISO, and other styles

7

Lecroisey, Loïc. "Les visages des sportifs : analyse des expressions faciales et des sous-rôles sociomoteurs par des observateurs selectionnés." Thesis, Sorbonne Paris Cité, 2017. http://www.theses.fr/2017USPCB096/document.

Full text

Abstract:

Parlebas (1970) affirmait déjà, il y a plus de quarante ans, « l’affectivité est la clef des conduites motrices ». De nombreux travaux se sont concentrés sur la verbalisation des émotions en contexte sportif. A priori ou a posteriori, c’est le sportif qui détermine ce qu’il ressent. Est-il possible de proposer une approche qui viendrait s’adjoindre à celles existantes afin de s’intéresser aux émotions qui naissent durant l’action motrice? L’objet de ce travail porte sur la mise en œuvre d’une méthodologie d’observation qui permet de préserver le caractère écologique de l’émotion sportive. Nous

APA, Harvard, Vancouver, ISO, and other styles

8

Rico-Fontalvo, Florentino Antonio. "A Decision Support Model for Personalized Cancer Treatment." Scholar Commons, 2014. https://scholarcommons.usf.edu/etd/5621.

Full text

Abstract:

This work is motivated by the need of providing patients with a decision support system that facilitates the selection of the most appropriate treatment strategy in cancer treatment. Treatment options are currently subject to predetermined clinical pathways and medical expertise, but generally, do not consider the individual patient characteristics or preferences. Although genomic patient data are available, this information is rarely used in the clinical setting for real-life patient care. In the area of personalized medicine, the advancement in the fundamental understanding of cancer biology

APA, Harvard, Vancouver, ISO, and other styles

9

Schulthess, Pascal. "Thermodynamic modeling explains the regulation of CYP1A1 expression in the liver." Doctoral thesis, Humboldt-Universität zu Berlin, Lebenswissenschaftliche Fakultät, 2016. http://dx.doi.org/10.18452/17454.

Full text

Abstract:

Die vorliegende Studie präsentiert eine Analyse der Integration der AhR und Wnt/beta-catenin Signalwege in den CYP1A1 Promotor sowie den regulatorischen Einfluss der Promotorlogik auf die Genexpression. Experimentell wurde diese Analyse mithilfe 29 mutagener Reporterkonstrukte des humanen CYP1A1 Promotors durchgeführt. Ein mathematisches Modell, welches eine Repräsentation des Crosstalks der Signaltransduktionswege mit einer statistisch mechanischen Beschreibung der kombinatorischen Promotorbelegung kombiniert, komplementierte den experimentellen Ansatz. Unter zusätzlicher Zuhilfenahme von gut

APA, Harvard, Vancouver, ISO, and other styles

10

Bahsoun, Jean-Paul. "Expression de la synchronisation dans un module contrôlé par priorité : implantation et méthode de preuve." Toulouse 3, 1988. http://www.theses.fr/1988TOU30126.

Full text

Abstract:

Le module controle par priorite (mcp) est un constructeur de type abstrait, avec un controleur local appele synchroniseur. Sa definition repose sur l'idee de base qu'il existe deux sortes de controles a effectuer pour acceder a un objet partage: les controles lies a l'etat intrinseque de l'objet et ceux provenant d'une politique d'utilisation de l'objet ou d'ordonnancement; ces deux types de controles sont separes dans le mcp

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Logic expression"

1

Horn, Laurence R. The expression of negation. Mouton de Gruyter, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Rinpoche, Shamar. A change of expression. s.n.], 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Stefanakis, Nikolaos. Regulatory Logic of Pan-neuronal Gene Expression in Caenorhabditis elegans. [publisher not identified], 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Brook, Clodagh J. The expression of the inexpressible in Eugenio Montale's poetry: Metaphor, negation, and silence. Oxford University Press, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Brandom, Robert. Articulating reasons: An introduction to inferentialism. Harvard University Press, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

John, Mason. Expressing generality. Centre for Mathematics Education, Open University, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Oral, Sabri Onur. The minimization of multiple valued logic expressions using parallel processors. Naval Postgraduate School, 1991.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Günter, Schenk, Kaufmann Matthias 1955-, and Krause Andrej 1965-, eds. Expressis verbis: Philosophische Betrachtungen : Festschrift für Günter Schenk zum fünfundsechzigsten Geburtstag. Hallescher Verlag, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Günter, Schenk, Kaufmann Matthias 1955-, and Krause Andrej 1965-, eds. Expressis verbis: Philosophische Betrachtungen : Festschrift für Günter Schenk zum fünfundsechzigsten Geburtstag. Hallescher Verlag, 2003.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Schweikardt, Nicole. On the expressive power of first-order logic with built in predicates. Logos, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Logic expression"

1

Cheng, Daizhan, Hongsheng Qi, and Zhiqiang Li. "Matrix Expression of Logic." In Communications and Control Engineering. Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-097-7_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Romanowska, Anna B., and Jonathan D. H. Smith. "Barycentric Algebras and Gene Expression." In Fuzzy Logic and Applications. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02282-1_3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Amato, R., A. Ciaramella, N. Deniskina, et al. "NEC for Gene Expression Analysis." In Fuzzy Logic and Applications. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11676935_30.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Sulzmann, Martin, and Kenny Zhuo Ming Lu. "POSIX Regular Expression Parsing with Derivatives." In Functional and Logic Programming. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-07151-0_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Lang, Serge. "Interlude On Logic and Mathematical Expression." In Basic Mathematics. Springer New York, 1988. http://dx.doi.org/10.1007/978-1-4612-1027-6_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bosin, Andrea, Nicoletta Dessì, Diego Liberati, and Barbara Pes. "Learning Bayesian Classifiers from Gene-Expression MicroArray Data." In Fuzzy Logic and Applications. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11676935_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Ruffino, Francesca, Marco Muselli, and Giorgio Valentini. "Biological Specifications for a Synthetic Gene Expression Data Generation Model." In Fuzzy Logic and Applications. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11676935_34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wang, Zili, Katherine Kosaian, and Kristin Yvonne Rozier. "Formally Verifying a Transformation from MLTL Formulas to Regular Expressions." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-90643-5_13.

Full text

Abstract:

Abstract Mission-time Linear Temporal Logic (MLTL), a widely used subset of popular specification logics like STL and MTL, is often used to model and verify real world systems in safety-critical contexts. As the results of formal verification are only as trustworthy as their input specifications, the WEST tool was created to facilitate writing MLTL specifications. Accordingly, it is vital to demonstrate that WEST itself works correctly. To that end, we verify the WEST algorithm, which converts MLTL formulas to (logically equivalent) regular expressions, in the theorem prover Isabelle/HOL. Our top-level result establishes the correctness of the regular expression transformation; we then generate a code export from our verified development and use this to experimentally validate the existing WEST tool. To facilitate this, we develop some verified support for checking the equivalence of two regular expressions.

APA, Harvard, Vancouver, ISO, and other styles

9

Salguero, Alberto, and Macarena Espinilla. "Description Logic Class Expression Learning Applied to Sentiment Analysis." In Sentiment Analysis and Ontology Engineering. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30319-2_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Chong, Cheun Ngen, Sandro Etalle, and Pieter H. Hartel. "Comparing Logic-Based and XML-Based Rights Expression Languages." In On The Move to Meaningful Internet Systems 2003: OTM 2003 Workshops. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-39962-9_78.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Logic expression"

1

Shen, Yibin, Qianying Liu, Zhuoyuan Mao, Zhen Wan, Fei Cheng, and Sadao Kurohashi. "Seeking Diverse Reasoning Logic: Controlled Equation Expression Generation for Solving Math Word Problems." In Proceedings of the 2nd Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics and the 12th International Joint Conference on Natural Language Processing (Volume 2: Short Papers). Association for Computational Linguistics, 2022. http://dx.doi.org/10.18653/v1/2022.aacl-short.32.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Gómez Álvarez, Lucía, and Sebastian Rudolph. "Reasoning in SHIQ with Axiom- and Concept-Level Standpoint Modalities." 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/36.

Full text

Abstract:

Standpoint logic is a recently proposed modal logic framework that is well-suited for multiperspective reasoning and ontology integration. For this reason, combinations of standpoint logic with description logics (DLs) are of special interest. Prior work has shown that it is possible to add standpoints to numerous decidable fragments of first-order logics - including very expressive DLs up to SROIQbs - while preserving their reasoning complexity, so long as standpoint modalities are limited to the axiom level. A more expressive tighter modal integration, where standpoint modalities are also al

APA, Harvard, Vancouver, ISO, and other styles

3

Wałęga, Przemysław Andrzej. "Expressive Power of Definite Descriptions in Modal Logics." 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/65.

Full text

Abstract:

Motivated by applications in knowledge representation and reasoning, modal and description logics have been recently extended with definite description operators. Such operators provide us with a tool for referring to a particular element of a model by stating a property satisfied only by this element. This mechanism resembles the way we refer to objects in natural language, which makes it an attractive component of ontology and query languages. In this paper, we aim to provide a tool for analysing the expressive power of logics with definite descriptions. In particular, we introduce an adequa

APA, Harvard, Vancouver, ISO, and other styles

4

Artale, Alessandro, Roman Kontchakov, Andrea Mazzullo, and Frank Wolter. "Non-Rigid Designators in Modal and Temporal Free Description Logics." 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/8.

Full text

Abstract:

Definite descriptions, such as ‘the General Chair of KR 2024’, are a semantically transparent device for object identification in knowledge representation. In first-order modal logic, definite descriptions have been widely investigated for their non-rigidity, which allows them to designate different objects (or none at all) at different states. We propose expressive modal description logics with non-rigid definite descriptions and names, and investigate decidability and complexity of the satisfiability problem. We first systematically link satisfiability for the one-variable fragment of first-

APA, Harvard, Vancouver, ISO, and other styles

5

Lutz, Carsten, and Lukas Schulze. "Description Logics with Abstraction and Refinement: From ALC to EL." 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/51.

Full text

Abstract:

We study extensions of description logics from the widely used EL family with operators that make it possible to speak about different levels of abstraction. We analyze the computational complexity of reasoning and show that often, this complexity is significantly lower than in the corresponding extension of the more expressive description logic ALC. By slightly varying the semantics, we also obtain a case that admits reasoning in polynomial time.

APA, Harvard, Vancouver, ISO, and other styles

6

Drexler, Dominik, Simon Ståhlberg, Blai Bonet, and Hector Geffner. "Symmetries and Expressive Requirements for Learning General Policies." 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/79.

Full text

Abstract:

State symmetries play an important role in planning and generalized planning. In the first case, state symmetries can be used to reduce the size of the search; in the second, to reduce the size of the training set. In the case of general planning, however, it is also critical to distinguish non-symmetric states, i.e., states that represent non-isomorphic relational structures. However, while the language of first-order logic distinguishes non-symmetric states, the languages and architectures used to represent and learn general policies do not. In particular, recent approaches for learning gene

APA, Harvard, Vancouver, ISO, and other styles

7

Ming-Yi Mao, Zhi-Cheng Chen, and Hua-Can He. "Expression object-oriented of universal logic." In Proceedings of 2005 International Conference on Machine Learning and Cybernetics. IEEE, 2005. http://dx.doi.org/10.1109/icmlc.2005.1527381.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

"FACIAL EXPRESSION RECOGNITION BASED ON FUZZY LOGIC." In International Conference on Computer Vision Theory and Applications. SciTePress - Science and and Technology Publications, 2008. http://dx.doi.org/10.5220/0001089603830388.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Atasu, Kubilay. "Leftmost longest regular expression matching in reconfigurable logic." In 2015 International Conference on Field Programmable Technology (FPT). IEEE, 2015. http://dx.doi.org/10.1109/fpt.2015.7393124.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Baker, Zachary, Hong-jip Jung, and Viktor Prasanna. "Regular Expression Software Deceleration for Intrusion Detection Systems." In 2006 International Conference on Field Programmable Logic and Applications. IEEE, 2006. http://dx.doi.org/10.1109/fpl.2006.311246.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Logic expression"

1

Lutz, Carsten, and Frank Wolter. Modal Logics of Topological Relations. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.142.

Full text

Abstract:

The eight topological RCC8(or Egenhofer-Franzosa)- relations between spatial regions play a fundamental role in spatial reasoning, spatial and constraint databases, and geographical information systems. In analogy with Halpern and Shoham’s modal logic of time intervals based on the Allen relations, we introduce a family of modal logics equipped with eight modal operators that are interpreted by the RCC8-relations. The semantics is based on region spaces induced by standard topological spaces, in particular the real plane. We investigate the expressive power and computational complexity of the

APA, Harvard, Vancouver, ISO, and other styles

2

Borgwardt, Stefan, Marcel Lippmann, and Veronika Thost. Reasoning with Temporal Properties over Axioms of DL-Lite. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.208.

Full text

Abstract:

Recently, a lot of research has combined description logics (DLs) of the DL-Lite family with temporal formalisms. Such logics are proposed to be used for situation recognition and temporalized ontology-based data access. In this report, we consider DL-Lite-LTL, in which axioms formulated in a member of the DL-Lite family are combined using the operators of propositional linear-time temporal logic (LTL). We consider the satisfiability problem of this logic in the presence of so-called rigid symbols whose interpretation does not change over time. In contrast to more expressive temporalized DLs,

APA, Harvard, Vancouver, ISO, and other styles

3

Brandt, Sebastian, Ralf Küsters, and Anni-Yasmin Turhan. Approximation and Difference in Description Logics. Aachen University of Technology, 2001. http://dx.doi.org/10.25368/2022.116.

Full text

Abstract:

Approximation is a new inference service in Description Logics first mentioned by Baader, Küsters, and Molitor. Approximating a concept, defined in one Description Logic, means to translate this concept to another concept, defined in a second typically less expressive Description Logic, such that both concepts are as closely related as possible with respect to subsumption. The present paper provides the first in-depth investigation of this inference task. We prove that approximations from the Description Logic ALC to ALE always exist and propose an algorithm computing them. As a measure for th

APA, Harvard, Vancouver, ISO, and other styles

4

Bonatti, Piero, Carsten Lutz, and Frank Wolter. Expressive Non-Monotonic Description Logics Based on Circumscription. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2022.149.

Full text

Abstract:

Recent applications of description logics (DLs) strongly suggest the integration of non-monotonic features into DLs, with particular attention to defeasible inheritance. However, the existing non-monotonic extensions of DLs are usually based on default logic or autoepistemic logic, and have to be seriously restricted in expressive power to preserve the decidability of reasoning. In particular, such DLs allow the modelling of defeasible inheritance only in a very restricted form, where non-monotonic reasoning is limited to individuals that are explicitly identified by constants in the knowledge

APA, Harvard, Vancouver, ISO, and other styles

5

Axford, Barrie. The Implications of Rising Multipolarity for Authoritarian Populist Governance, Multilateralism, and the Nature of New Globalization. European Center for Populism Studies (ECPS), 2024. http://dx.doi.org/10.55271/pp0031.

Full text

Abstract:

What is it about the current phase of globalization that feeds on and is fed by the populist zeitgeist? In what follows I will tie the discussion of populism to the changing character of globalization, sometimes called the “new” globalization, though that label does less than justice to the overlapping nature of historical globalizations. The “new” globalization is both a description of the de-centered and multi-polar constitution of globality today and a reflex to safeguard against the roils of an ever more connected and turbulent world. It is a reminder that globalization has always been a m

APA, Harvard, Vancouver, ISO, and other styles

6

Baudinet, Marianne. Temporal Logic Programming is Complete and Expressive,. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada326173.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Peñaloza, Rafael, and Barış Sertkaya. On the Complexity of Axiom Pinpointing in Description Logics. Technische Universität Dresden, 2009. http://dx.doi.org/10.25368/2022.173.

Full text

Abstract:

We investigate the computational complexity of axiom pinpointing in Description Logics, which is the task of finding minimal subsets of a knowledge base that have a given consequence. We consider the problems of enumerating such subsets with and without order, and show hardness results that already hold for the propositional Horn fragment, or for the Description Logic EL. We show complexity results for several other related decision and enumeration problems for these fragments that extend to more expressive logics. In particular we show that hardness of these problems depends not only on expre

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. A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.139.

Full text

Abstract:

In two previous papers we have investigates the problem of computing the least common subsumer (lcs) and the most specific concept (msc) for the description logic EL in the presence of terminological cycles that are interpreted with descriptive semantics, which is the usual first-order semantics for description logics. In this setting, neither the lcs nor the msc needs to exist. We were able to characterize the cases in which the lcs/msc exists, but it was not clear whether this characterization yields decidability of the existence problem. In the present paper, we develop a common graph-theor

APA, Harvard, Vancouver, ISO, and other styles

10

Lutz, Carsten, Carlos Areces, Ian Horrocks, and Ulrike Sattler. Keys, Nominals, and Concrete Domains. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.122.

Full text

Abstract:

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to 'concrete' domains such as numbers and strings with built-in predicates such as <, +, and prefix-of. These hybrid DLs have turned out to be quite useful for reasoning about conceptual models of information systems, and as the basis for expressive ontology languages. We propose to further extend such DLs with key constraints that allow the expression of statements like 'US citizens are uniquely identified by their social security number'. Based on this idea, we introduce a number

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!