Готові списки джерел за темами / Classical or Formal Logic

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій
Звіти організацій

Добірка наукової літератури з теми "Classical or Formal Logic"

Автор: Grafiati

Опубліковано: 3 червня 2025

Оновлено: 31 липня 2025

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Classical or Formal Logic".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "Classical or Formal Logic"

Kakas, Antonis. "Informalizing Formal Logic." Informal Logic 39, no. 2 (2019): 169–204. http://dx.doi.org/10.22329/il.v39i2.5169.

Повний текст джерела

Анотація:

This paper presents a way in which formal logic can be understood and reformulated in terms of argumentation that can help us unify formal and informal reasoning. Classical deductive reasoning will be expressed entirely in terms of notions and concepts from argumentation so that formal logical entailment is equivalently captured via the arguments that win between those supporting concluding formulae and arguments supporting contradictory formulae. This allows us to go beyond Classical Logic and smoothly connect it with human reasoning, thus providing a uniform argumentation-based view of both

Стилі APA, Harvard, Vancouver, ISO та ін.

Карниэлли, У. "Formal polynomials, heuristics and proofs in logic." Logical Investigations 16 (April 7, 2010): 280–94. http://dx.doi.org/10.21146/2074-1472-2010-16-0-280-294.

Повний текст джерела

Анотація:

This note surveys some previous results on the role of formal polynomials as a representation method for logical derivation in classical and non-classical logics, emphasizing many-valued logics, paraconsistent logics and modal logics. It also discusses the potentialities of formal polynomials as heuristic devices in logic and for expressing certain meta-logical properties, as well as pointing to some promising generalizations towards algebraic geometry.

Стилі APA, Harvard, Vancouver, ISO та ін.

Kazumi, Inoue. "Dialectical Contradictions and Classical Formal Logic." International Studies in the Philosophy of Science 28, no. 2 (2014): 113–32. http://dx.doi.org/10.1080/02698595.2014.932526.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Oliveira, Kleidson Êglicio Carvalho da Silva. "Paraconsistent Logic Programming in Three and Four-Valued Logics." Bulletin of Symbolic Logic 28, no. 2 (2022): 260. http://dx.doi.org/10.1017/bsl.2021.34.

Повний текст джерела

Анотація:

AbstractFrom the interaction among areas such as Computer Science, Formal Logic, and Automated Deduction arises an important new subject called Logic Programming. This has been used continuously in the theoretical study and practical applications in various fields of Artificial Intelligence. After the emergence of a wide variety of non-classical logics and the understanding of the limitations presented by first-order classical logic, it became necessary to consider logic programming based on other types of reasoning in addition to classical reasoning. A type of reasoning that has been well stu

Стилі APA, Harvard, Vancouver, ISO та ін.

Raikhert, Kostiantyn. "LOGIC, RHETORIC, AND HEURISTIC AS ARGUMENTATION THEORIES: AN OUTLINE." Doxa, no. 1(41) (June 27, 2024): 17–25. https://doi.org/10.18524/2410-2601.2024.1(41).316155.

Повний текст джерела

Анотація:

The study speculates about logic, rhetoric and heuristics as kinds of argumentation theory. Contemporary argumentation theories are informal logics, and it takes work to distinguish between them. The ultimate aim of traditional formal logic is to study proofs and refutations as logical forms, i.e., argumentation, so traditional logic can be seen as an argumentation theory. Classical and non-classical formal logics have traditional formal logic at their core. It allows them to be seen as argumentation theories. Rhetoric uses argumentation as a means of persuasion, and argument is understood muc

Стилі APA, Harvard, Vancouver, ISO та ін.

Ciuni, Roberto, and Massimiliano Carrara. "Normality operators and classical recapture in many-valued logic." Logic Journal of the IGPL 28, no. 5 (2018): 657–83. http://dx.doi.org/10.1093/jigpal/jzy055.

Повний текст джерела

Анотація:

AbstractIn this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some (or all) of the three properties, namely subclassicality and two properties that we call fixed-point negation property and conservativeness. In the second part of the

Стилі APA, Harvard, Vancouver, ISO та ін.

Angel, Garrido, and Yuste Piedad. "BRAIN Journal - Controversies about the Introduction of Non-Classical Logics." BRAIN - Broad Research in Artificial Intelligence and Neuroscience 5, no. 1-5 (2014): 34–45. https://doi.org/10.5281/zenodo.1044117.

Повний текст джерела

Анотація:

ABSTRACT Logic is a set of well-formed formulae, along with an inference relation. But the Classical Logic is bivalent; for this reason, very limited to solve problems with uncertainty on the data. It is well-known that Artificial Intelligence requires Logic. Because its Classical version shows too many insufficiencies, it is very necessary to introduce more sophisticated tools, as may be NonClassical Logics; amongst them, Fuzzy Logic, Modal Logic, Non-Monotonic Logic, Para-consistent Logic, and so on. All them in the same line: against the dogmatism and the dualistic vision of the world: abso

Стилі APA, Harvard, Vancouver, ISO та ін.

BRAUER, ETHAN. "RELEVANCE FOR THE CLASSICAL LOGICIAN." Review of Symbolic Logic 13, no. 2 (2018): 436–57. http://dx.doi.org/10.1017/s1755020318000382.

Повний текст джерела

Анотація:

AbstractAlthough much technical and philosophical attention has been given to relevance logics, the notion of relevance itself is generally left at an intuitive level. It is difficult to find in the literature an explicit account of relevance in formal reasoning. In this article I offer a formal explication of the notion of relevance in deductive logic and argue that this notion has an interesting place in the study of classical logic. The main idea is that a premise is relevant to an argument when it contributes to the validity of that argument. I then argue that the sequents which best embod

Стилі APA, Harvard, Vancouver, ISO та ін.

Ciuciura, Janusz. "Intuitionistic Implication and Logics of Formal Inconsistency." Axioms 13, no. 11 (2024): 738. http://dx.doi.org/10.3390/axioms13110738.

Повний текст джерела

Анотація:

Logics of Formal Inconsistency (LFI for short) are a class of paraconsistent logics that validate the principle of gentle explosion, meaning that any formula can be derived from the set of formulas: ∘α, α and ∼α. A unique feature of LFI is the use of the symbol ‘∘’ to represent notions of consistency at the object-language level. These logics are simple in essence, built upon all the axiom schemas of positive classical logic, axioms for negation and the so-called ‘consistency operator’ ∘, with the only inference rule being detachment. In this paper, we propose an alternative foundation for LFI

Стилі APA, Harvard, Vancouver, ISO та ін.

Sherry, David. "Formal Logic for Informal Logicians." Informal Logic 26, no. 2 (2008): 199. http://dx.doi.org/10.22329/il.v26i2.444.

Повний текст джерела

Анотація:

Classical logic yields counterintuitive results for numerous propositional argument forms. The usual alternatives (modal logic, relevance logic, etc.) generate counterintuitive results of their own. The counterintuitive results create problems—especially pedagogical problems—for informal logicians who wish to use formal logic to analyze ordinary argumentation. This paper presents a system, PL– (propositional logic minus the funny business), based on the idea that paradigmatic valid argument forms arise from justificatory or explanatory discourse. PL– avoids the pedagogical difficulties without

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "Classical or Formal Logic"

Bueno-Soler, Juliana 1976. "Multimodalidades anodicas e catodicas : a negação controlada em logicas multimodais e seu poder expressivo." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/280387.

Повний текст джерела

Анотація:

Orientador: Itala Maria Loffredo D'Ottaviano Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas Made available in DSpace on 2018-09-11T21:14:41Z (GMT). No. of bitstreams: 1 Bueno-Soler_Juliana_D.pdf: 1230879 bytes, checksum: c04ce9e8061c154854f6283749f9c12b (MD5) Previous issue date: 2009 Resumo: O presente trabalho tem por objetivo investigar o papel da negação no âmbito das modalidades, de forma a poder esclarecer até que ponto a negação pode ser atenuada, controlada ou mesmo totalmente eliminada em favor da melhor expressabilidade lógi

Стилі APA, Harvard, Vancouver, ISO та ін.

Rodrigues, Tarcísio Genaro. "Sobre os fundamentos de programação lógica paraconsistente." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/278897.

Повний текст джерела

Анотація:

Orientador: Marcelo Esteban Coniglio Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas Made available in DSpace on 2018-08-17T03:29:03Z (GMT). No. of bitstreams: 1 Rodrigues_TarcisioGenaro_M.pdf: 1141020 bytes, checksum: 59bb8a3ae7377c05cf6a8d8e6f7e45a5 (MD5) Previous issue date: 2010 Resumo: A Programação Lógica nasce da interação entre a Lógica e os fundamentos da Ciência da Computação: teorias de primeira ordem podem ser interpretadas como programas de computador. A Programação Lógica tem sido extensamente utilizada em ramos da

Стилі APA, Harvard, Vancouver, ISO та ін.

Neto, Adolfo Gustavo Serra Seca. "\"Um provador de teoremas multi-estratégia\"." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-04052007-175943/.

Повний текст джерела

Анотація:

Nesta tese apresentamos o projeto e a implementação do KEMS, um provador de teoremas multi-estratégia baseado no método de tablôs KE. Um provador de teoremas multi-estratégia é um provador de teoremas onde podemos variar as estratégias utilizadas sem modificar o núcleo da implementação. Além de multi-estratégia, o KEMS é capaz de provar teoremas em três sistemas lógicos: lógica clássica proposicional, mbC e mCi. Listamos abaixo algumas das contribuições deste trabalho: * um sistema KE para mbC que é analítico, correto e completo; * um sistema KE para mCi que é correto e completo; * um provad

Стилі APA, Harvard, Vancouver, ISO та ін.

Urban, Christian. "Classical logic and computation." Thesis, University of Cambridge, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621950.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Goldsmith, M. H. "Logic, programming and formal specification." Thesis, University of Oxford, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.371541.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

McPartlin, Michael P. "Non-classical modal logic for belief." Thesis, University of Edinburgh, 1991. http://hdl.handle.net/1842/11150.

Повний текст джерела

Анотація:

The standard model of knowledge and belief attributes to agents the ability to reason perfectly in classical logic. This is known as the problem of logical omniscience and, in accordance with the requirements of their contexts of use, has led to the development of a number of alternative epistemic logics. Some of these alternatives can, like the standard model, be regarded as presenting for discussion and analysis in a base language a system of reasoning, or consequence relation: the relation under which beliefs are closed. Adopting this perspective with regard to a useful four-valued logic, t

Стилі APA, Harvard, Vancouver, ISO та ін.

Almeida, João Marcos de 1974. "Logics of Formal Inconsistency." Phd thesis, Instituições portuguesas -- UTL-Universidade Técnica de Lisboa -- IST-Instituto Superior Técnico -- -Departamento de Matemática, 2005. http://dited.bn.pt:80/29635.

Повний текст джерела

Анотація:

According to the classical consistency presupposition, contradictions have an explosive character: Whenever they are present in a theory, anything goes, and no sensible reasoning can thus take place. A logic is paraconsistent if it disallows such presupposition, and allows instead for some inconsistent yet non-trivial theories to make perfect sense. The Logics of Formal Inconsistency, LFIs, form a particularly expressive class of paraconsistent logics in which the metatheoretical notion of consistency can be internalized at the object-language level. As a consequence, the LFIs are able to r

Стилі APA, Harvard, Vancouver, ISO та ін.

Yim, Austin Vincent. "On Galois correspondences in formal logic." Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:b47d1dda-8186-4c81-876c-359409f45b97.

Повний текст джерела

Анотація:

This thesis examines two approaches to Galois correspondences in formal logic. A standard result of classical first-order model theory is the observation that models of L-theories with a weak form of elimination of imaginaries hold a correspondence between their substructures and automorphism groups defined on them. This work applies the resultant framework to explore the practical consequences of a model-theoretic Galois theory with respect to certain first-order L-theories. The framework is also used to motivate an examination of its underlying model-theoretic foundations. The model-theoreti

Стилі APA, Harvard, Vancouver, ISO та ін.

Blot, Valentin. "Game semantics and realizability for classical logic." Thesis, Lyon, École normale supérieure, 2014. http://www.theses.fr/2014ENSL0945/document.

Повний текст джерела

Анотація:

Cette thèse étudie deux modèles de réalisabilité pour la logique classique construits sur la sémantique des jeux HO, interprétant la logique, l'arithmétique et l'analyse classiques directement par des programmes manipulant un espace de stockage d'ordre supérieur.La non-innocence en jeux HO autorise les références d'ordre supérieur, et le non parenthésage révèle la CPS des jeux HO et fournit une catégorie de continuations dans laquelle interpréter le lambda-mu calcul de Parigot. Deux modèles de réalisabilité sont construits sur cette interprétation calculatoire directe des preuves classiques.Le

Стилі APA, Harvard, Vancouver, ISO та ін.

Wood, Kenneth Robert. "Parallel logic simulation and applied formal methods." Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.315774.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Книги з теми "Classical or Formal Logic"

Hidalgo, Araceli C. H.P. Grice's defense of the two-valued formal system of classical logic: A critique. Asian Center, University of the Philippines, 1985.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Świętorzecka, Kordula. Classical conceptions of the changeability of situations and thing represented in formalized languages. Wydawn. Uniwersytetu Kardynała Stefana Wyszyńskiego, 2008.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ribeiro, Márcio Moretto. Belief Revision in Non-Classical Logics. Springer London, 2013.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Shevcov, Aleksandr. Classical and non-classical logic in historical-philosophical aspect: basic principles and concepts. INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1018310.

Повний текст джерела

Анотація:

In the textbook systematically described the concept of logic — of the subject, understood as the Foundation of philosophy. Special emphasis is placed on the historical background of the development of logic, it is emphasized that logic as a scientific discipline was formed in close connection with other Sciences, including natural science profile. Content of the manual fully complies with the requirements of Federal state educational standard of higher education in the direction of training 47.04.01 "Philosophy".  Recommended for students of higher educational institutions studyin

Стилі APA, Harvard, Vancouver, ISO та ін.

Jago, Mark. Formal logic. Humanities-Ebooks, 2007.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Miller, David. Formal logic workbook. 4th ed. Department of Philosophy, University of Warwick, 2000.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Yrjönsuuri, Mikko, ed. Medieval Formal Logic. Springer Netherlands, 2001. http://dx.doi.org/10.1007/978-94-015-9713-5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

David, Miller. Formal logic: Workbook. 3rd ed. Department of Philosophy, University of Warwick, 1993.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hahn, Robert. Formal deductive logic: A logic workbook. 5th ed. Simon & Schuster, 1998.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Slater, B. H. Prolegomena to formal logic. Avebury, 1988.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Частини книг з теми "Classical or Formal Logic"

Monin, Jean-François, and Michael G. Hinchey. "Classical Logic." In Understanding Formal Methods. Springer London, 2003. http://dx.doi.org/10.1007/978-1-4471-0043-0_5.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Reghiş, Mircea, and Eugene Roventa. "The Formal Language of Propositional Logic." In Classical and Fuzzy Concepts in Mathematical Logic and Applications. CRC Press, 2022. http://dx.doi.org/10.1201/9781003067924-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Reghiş, Mircea, and Eugene Roventa. "The Formal Language of Predicate Logic." In Classical and Fuzzy Concepts in Mathematical Logic and Applications. CRC Press, 2022. http://dx.doi.org/10.1201/9781003067924-13.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Genco, Francesco A., and Francesca Poggiolesi. "Defining Formal Explanation in Classical Logic by Substructural Derivability." In Lecture Notes in Computer Science. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80049-9_22.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Miarka, Ralph, John Derrick, and Eerke Boiten. "Handling Inconsistencies in Z Using Quasi-Classical Logic." In ZB 2002:Formal Specification and Development in Z and B. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45648-1_11.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

van der Berg, Ineke, Andrea De Domenico, Giuseppe Greco, Krishna B. Manoorkar, Alessandra Palmigiano, and Mattia Panettiere. "Non-distributive Description Logic." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43513-3_4.

Повний текст джерела

Анотація:

Abstract We define LE-$$\mathcal {ALC}$$, a generalization of the description logic $$\mathcal {ALC}$$ based on the propositional logic of general (i.e. not necessarily distributive) lattices, and semantically interpreted on relational structures based on formal contexts from Formal Concept Analysis (FCA). The description logic LE-$$\mathcal {ALC}$$ allows us to formally describe databases with objects, features, and formal concepts, represented according to FCA as Galois-stable sets of objects and features. We describe ABoxes and TBoxes in LE-$$\mathcal {ALC}$$, provide a tableaux algorithm f

Стилі APA, Harvard, Vancouver, ISO та ін.

Ramsey, F. P. "On a Problem of Formal Logic." In Classic Papers in Combinatorics. Birkhäuser Boston, 2009. http://dx.doi.org/10.1007/978-0-8176-4842-8_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hallaq, Wael B. "Logic, formal arguments and formalization of arguments in sunnī jurisprudence." In Law and Legal Theory in Classical and Medieval Islam. Routledge, 2022. https://doi.org/10.4324/9781003278856-3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Ciardelli, Ivano. "Inquisitive Modal Logic: A Preview." In Trends in Logic. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-09706-5_8.

Повний текст джерела

Анотація:

AbstractThroughout this book, we have emphasized different ways in which questions are relevant in logic. We saw that questions can be seen as names for types of information, and that by generalizing logic to questions we can capture logical relations holding between information types. We also saw that in the inquisitive setting, a more general account of certain logical operators emerges, which boils down to the classical one in the special case of statements, but which also covers the role of these operators in questions. Furthermore, we saw that questions may be used in inferences as placeh

Стилі APA, Harvard, Vancouver, ISO та ін.

Berger, Ulrich, and Hideki Tsuiki. "Extracting total Amb programs from proofs." In Programming Languages and Systems. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99336-8_4.

Повний текст джерела

Анотація:

AbstractWe present a logical system CFP (Concurrent Fixed Point Logic) that supports the extraction of nondeterministic and concurrent programs that are provably total and correct. CFP is an intuitionistic first-order logic with inductive and coinductive definitions extended by two propositional operators, $$B|_{A}$$ B | A (restriction, a strengthening of implication) and $${\mathbf {\downdownarrows }}(B)$$ ⇊ ( B ) (total concurrency). The source of the extraction are formal CFP proofs, the target is a lambda calculus with constructors and recursion extended by a constructor Amb (for McCarthy’

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "Classical or Formal Logic"

Ghosh, Krishnendu, and Channing Smith. "Formal Analysis of Deontic Logic Model for Ethical Decisions." In 17th International Conference on Agents and Artificial Intelligence. SCITEPRESS - Science and Technology Publications, 2025. https://doi.org/10.5220/0013385200003890.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Casini, Giovanni, Thomas Meyer, and Ivan Varzinczak. "Rational Defeasible Belief Change." In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/22.

Повний текст джерела

Анотація:

We present a formal framework for modelling belief change within a nonmonotonic reasoning system. Belief change and non-monotonic reasoning are two areas that are formally closely related, with recent attention being paid towards the analysis of belief change within a non-monotonic environment. In this paper we consider the classical AGM belief change operators, contraction and revision, applied to a defeasible setting in the style of Kraus, Lehmann, and Magidor. The investigation leads us to the consideration of the problem of iterated change, generalising the classical work of Darwiche and P

Стилі APA, Harvard, Vancouver, ISO та ін.

Baker, Clayton. "Predictive Modelling of Human Reasoning Using AGM Belief Revision." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/811.

Повний текст джерела

Анотація:

While many forms of belief change exist, the relationship between belief revision and human reasoning is of primary interest in this work. The theory of belief revision extends classical two-valued logic with an approach to resolve the conflict between a set of beliefs and newly learned information. The goal of this project is to test how humans revise conflicting beliefs. Experiments are proposed in which human subjects are required to resolve conflicting beliefs via relevance and confidence. In our analysis, the human responses will be evaluated against the predictions of two perspectives of

Стилі APA, Harvard, Vancouver, ISO та ін.

Salhi, Yakoub. "Inconsistency Measurement for Improving Logical Formula Clustering." In Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/262.

Повний текст джерела

Анотація:

Formal logic can be used as a tool for representing complex and heterogeneous data such as beliefs, knowledge and preferences. This study proposes an approach for defining clustering methods that deal with bases of propositional formulas in classical logic, i.e., methods for dividing formula bases into meaningful groups. We first use a postulate-based approach for introducing an intuitive framework for formula clustering. Then, in order to characterize interesting clustering forms, we introduce additional properties that take into consideration different notions, such us logical consequence, o

Стилі APA, Harvard, Vancouver, ISO та ін.

Si, Xujie, Mukund Raghothaman, Kihong Heo, and Mayur Naik. "Synthesizing Datalog Programs using Numerical Relaxation." In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/847.

Повний текст джерела

Анотація:

The problem of learning logical rules from examples arises in diverse fields, including program synthesis, logic programming, and machine learning. Existing approaches either involve solving computationally difficult combinatorial problems, or performing parameter estimation in complex statistical models. In this paper, we present Difflog, a technique to extend the logic programming language Datalog to the continuous setting. By attaching real-valued weights to individual rules of a Datalog program, we naturally associate numerical values with individual conclusions of the program. Analogous t

Стилі APA, Harvard, Vancouver, ISO та ін.

Bogaerts, Bart, Joost Vennekens, and Marc Denecker. "Safe Inductions: An Algebraic Study." 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/119.

Повний текст джерела

Анотація:

In many knowledge representation formalisms, a constructive semantics is defined based on sequential applications of rules or of a semantic operator. These constructions often share the property that rule applications must be delayed until it is safe to do so: until it is known that the condition that triggers the rule will remain to hold. This intuition occurs for instance in the well-founded semantics of logic programs and in autoepistemic logic. In this paper, we formally define the safety criterion algebraically. We study properties of so-called safe inductions and apply our theory to logi

Стилі APA, Harvard, Vancouver, ISO та ін.

Baumann, Ringo, and Maximilian Heinrich. "Bipolar Abstract Dialectical Frameworks Are Covered by Kleene’s Three-valued Logic." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/348.

Повний текст джерела

Анотація:

Abstract dialectical frameworks (ADFs) are one of the most powerful generalizations of classical Dung-style argumentation frameworks (AFs). The additional expressive power comes with an increase in computational complexity, namely one level up in the polynomial hierarchy in comparison to their AF counterparts. However, there is one important subclass, so-called bipolar ADFs (BADFs) which are as complex as classical AFs while offering strictly more modeling capacities. This property makes BADFs very attractive from a knowledge representation point of view and is the main reason why this class h

Стилі APA, Harvard, Vancouver, ISO та ін.

Munteanu, Dan, and Nicoleta Munteanu. "COMPARISON BETWEEN ASSISTED TRAINING AND CLASSICAL TRAINING IN NONFORMAL LEARNING BASED ON AUTOMATIC ATTENTION MEASUREMENT USING A NEUROFEEDBACK DEVICE." In eLSE 2019. Carol I National Defence University Publishing House, 2019. http://dx.doi.org/10.12753/2066-026x-19-041.

Повний текст джерела

Анотація:

The non-formal education consists in the expression of personal interests through the voluntary participation of the young person in activities that are of interest or attract him directly in order either to spend free time in a constructive manner, or to develop personality or to grasp special talents in - an institutionalized framework. Attention is the process that ensures the active orientation of the body to the message selection, the anticipatory reception and executory adjustment, as well as the intermittent focusing. In general, in the educational instructive process, attention is moni

Стилі APA, Harvard, Vancouver, ISO та ін.

Ionita, Mirela, and Veronica Pastae. "DIDACTIC COMMUNICATION IN THE ONLINE ENVIRONMENT." In eLSE 2015. Carol I National Defence University Publishing House, 2015. http://dx.doi.org/10.12753/2066-026x-15-011.

Повний текст джерела

Анотація:

Abstract: Didactic communication is the explanatory dimension of pedagogical communication, and is characterized by its specific goal of facilitating the transfer of knowledge. Thus, the contents are not stated and explained in their purely scientific form: instead, they are rephrased so as to be understood by their recipients, according to certain cognitive and psychological parameters, and are structured following the principles of pedagogical logic. Psychopedagogical communication underlies the formal educational process, and it entails the sharing of didacticized information with education

Стилі APA, Harvard, Vancouver, ISO та ін.

Simpson, Andrew. "Logic, damned logic, and statistics." In Teaching Formal Methods: Practice and Experience. BCS Learning & Development, 2006. http://dx.doi.org/10.14236/ewic/tfm2006.9.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Звіти організацій з теми "Classical or Formal Logic"

Baader, Franz, and Felix Distel. A finite basis for the set of EL-implications holding in a finite model. Technische Universität Dresden, 2007. http://dx.doi.org/10.25368/2022.160.

Повний текст джерела

Анотація:

Formal Concept Analysis (FCA) can be used to analyze data given in the form of a formal context. In particular, FCA provides efficient algorithms for computing a minimal basis of the implications holding in the context. In this paper, we extend classical FCA by considering data that are represented by relational structures rather than formal contexts, and by replacing atomic attributes by complex formulae defined in some logic. After generalizing some of the FCA theory to this more general form of contexts, we instantiate the general framework with attributes defined in the Description Logic (

Стилі APA, Harvard, Vancouver, ISO та ін.

Thost, Veronika, Jan Holste, and Özgür Özçep. On Implementing Temporal Query Answering in DL-Lite. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.218.

Повний текст джерела

Анотація:

Ontology-based data access augments classical query answering over fact bases by adopting the open-world assumption and by including domain knowledge provided by an ontology. We implemented temporal query answering w.r.t. ontologies formulated in the Description Logic DL-Lite. Focusing on temporal conjunctive queries (TCQs), which combine conjunctive queries via the operators of propositional linear temporal logic, we regard three approaches for answering them: an iterative algorithm that considers all data available; a window-based algorithm; and a rewriting approach, which translates the TCQ

Стилі APA, Harvard, Vancouver, ISO та ін.

Obua, Steven. Abstraction Logic. Recursive Mind, 2021. http://dx.doi.org/10.47757/abstraction.logic.2.

Повний текст джерела

Анотація:

Abstraction Logic is introduced as a foundation for Practical Types and Practal. It combines the simplicity of ﬁrst-order logic with direct support for variable binding constants called abstractions. It also allows free variables to depend on parameters, which means that ﬁrst-order axiom schemata can be encoded as simple axioms. Conceptually abstraction logic is situated between ﬁrst-order logic and second-order logic. It is sound with respect to an intuitive and simple algebraic semantics. Completeness holds for both intuitionistic and classical abstraction logic, and all abstraction logics i

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, Bernhard Ganter, Ulrike Sattler, and Barış Sertkaya. Completing Description Logic Knowledge Bases using Formal Concept Analysis. Aachen University of Technology, 2006. http://dx.doi.org/10.25368/2022.155.

Повний текст джерела

Анотація:

We propose an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using information provided by the assertional part and by a domain expert. The use of techniques from Formal Concept Analysis ensures that, on the one hand, the interaction with the expert is kept to a minimum, and, on the other hand, we can show that the extended knowledge base is complete in a certain sense.

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, Francesco Kriegel, Adrian Nuradiansyah, and Rafael Peñaloza. Repairing Description Logic Ontologies by Weakening Axioms. Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.238.

Повний текст джерела

Анотація:

The classical approach for repairing a Description Logic ontology O in the sense of removing an unwanted consequence α is to delete a minimal number of axioms from O such that the resulting ontology O´ does not have the consequence α. However, the complete deletion of axioms may be too rough, in the sense that it may also remove consequences that are actually wanted. To alleviate this problem, we propose a more gentle way of repair in which axioms are not necessarily deleted, but only weakened. On the one hand, we investigate general properties of this gentle repair method. On the other hand,

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, and Felix Distel. Exploring finite models in the Description Logic ELgfp. Technische Universität Dresden, 2008. http://dx.doi.org/10.25368/2022.168.

Повний текст джерела

Анотація:

In a previous ICFCA paper we have shown that, in the Description Logics EL and ELgfp, the set of general concept inclusions holding in a finite model always has a finite basis. In this paper, we address the problem of how to compute this basis efficiently, by adapting methods from formal concept analysis.

Стилі APA, Harvard, Vancouver, ISO та ін.

Baader, Franz, Oliver Fernández Gil, and Barbara Morawska. Hybrid Unification in the Description Logic EL. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.197.

Повний текст джерела

Анотація:

Unification in Description Logics (DLs) has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the DL EL, which is used to define several large biomedical ontologies, unification is NP-complete. However, the unification algorithms for EL developed until recently could not deal with ontologies containing general concept inclusions (GCIs). In a series of recent papers we have made some progress towards addressing this problem, but the ontologies the developed unification algorithms can deal with need to satisfy a certain cycle restricti

Стилі APA, Harvard, Vancouver, ISO та ін.

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.

Повний текст джерела

Анотація:

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 та ін.

Ma, Yue, and Felix Distel. Learning Formal Definitions for Snomed CT from Text. Technische Universität Dresden, 2013. http://dx.doi.org/10.25368/2022.193.

Повний текст джерела

Анотація:

Snomed CT is a widely used medical ontology which is formally expressed in a fragment of the Description Logic EL++. The underlying logics allow for expressive querying, yet make it costly to maintain and extend the ontology. Existing approaches for ontology generation mostly focus on learning superclass or subclass relations and therefore fail to be used to generate Snomed CT definitions. In this paper, we present an approach for the extraction of Snomed CT definitions from natural language texts, based on the distance relation extraction approach. By benefiting from a relatively large amount

Стилі APA, Harvard, Vancouver, ISO та ін.

Xu, Chao, Walter Forkel, Stefan Borgwardt, Franz Baader, and Beihai Zhou. Automatic Translation of Clinical Trial Eligibility Criteria into Formal Queries. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.224.

Повний текст джерела

Анотація:

Selecting patients for clinical trials is very labor-intensive. Our goal is to develop an automated system that can support doctors in this task. This paper describes a major step towards such a system: the automatic translation of clinical trial eligibility criteria from natural language into formal, logic-based queries. First, we develop a semantic annotation process that can capture many types of clinical trial criteria. Then, we map the annotated criteria to the formal query language. We have built a prototype system based on state-of-the-art NLP tools such as Word2Vec, Stanford NLP tools,

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!