Relevant bibliographies by topics / The rules of logic

Contents

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

Academic literature on the topic 'The rules of logic'

Author: Grafiati
Published: 2 June 2025
Last updated: 31 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 'The rules of logic.'

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 "The rules of logic"

1

Rimatskiy, V. V. "Globally Admissible Inference Rules." Bulletin of Irkutsk State University. Series Mathematics 42 (2022): 138–60. http://dx.doi.org/10.26516/1997-7670.2022.42.138.

Full text
Abstract:
Setting the basic rules of inference is fundamental to logic. The most general variant of possible inference rules are admissible inference rules: in logic 𝐿, a rule of inference is admissible if the set of theorems 𝐿 is closed with respect to this rule. The study of admissible inference rules was stimulated by Friedman’s problem: Is there an algorithm for recognizing the admissibility of an inference rule in intuitionistic logic? For a wide class of non-classical logics the problem of recognizing with respect to the admissibility of inference rules was solved in 1980s. Another way of describi
APA, Harvard, Vancouver, ISO, and other styles
2

Rimatskiy, V. V. "https://mathizv.isu.ru/en/article?id=1516." Bulletin of Irkutsk State University. Series Mathematics 50 (2024): 152–69. https://doi.org/10.26516/1997-7670.2024.50.152.

Full text
Abstract:
Setting the basic rules of inference is fundamental to logic. The most general variant of possible inference rules are admissible inference rules:in logic L, a rule of inference is admissible if the set of theorems L is closed with respect to this rule. The study of admissible inference rules was stimulated by the formulation of problems about decidability by admissibility (Friedman) and the presence of a finite basis of admissible rules (Kuznetsov) in Int logic. In the early 2000s, for most basic non-classical logics and some tabular logics, the Fridman-Kuznetsov problem was solved by describ
APA, Harvard, Vancouver, ISO, and other styles
3

Evans, R., M. Sergot, and A. Stephenson. "Formalizing Kant’s Rules." Journal of Philosophical Logic 49, no. 4 (2019): 613–80. http://dx.doi.org/10.1007/s10992-019-09531-x.

Full text
Abstract:
AbstractThis paper formalizes part of the cognitive architecture that Kant develops in the Critique of Pure Reason. The central Kantian notion that we formalize is the rule. As we interpret Kant, a rule is not a declarative conditional stating what would be true if such and such conditions hold. Rather, a Kantian rule is a general procedure, represented by a conditional imperative or permissive, indicating which acts must or may be performed, given certain acts that are already being performed. These acts are not propositions; they do not have truth-values. Our formalization is related to the
APA, Harvard, Vancouver, ISO, and other styles
4

Rimatskiy, V. V. "Admissible Inference Rules and Semantic Property of Modal Logics." Bulletin of Irkutsk State University. Series Mathematics 37 (2021): 104–17. http://dx.doi.org/10.26516/1997-7670.2021.37.104.

Full text
Abstract:
Firstly semantic property of nonstandart logics were described by formulas which are peculiar to studied a models in general, and do not take to consideration a variable conditions and a changing assumptions. Evidently the notion of inference rule generalizes the notion of formulas and brings us more flexibility and more expressive power to model human reasoning and computing. In 2000-2010 a few results on describing of explicit bases for admissible inference rules for nonstandard logics (S4, K4, H etc.) appeared. The key property of these logics was weak co-cover property. Beside the improvem
APA, Harvard, Vancouver, ISO, and other styles
5

Batens, Diderik. "Devising the set of abnormalities for a given defeasible rule." Logical Investigations 26, no. 1 (2020): 9–35. http://dx.doi.org/10.21146/2074-1472-2020-26-1-9-35.

Full text
Abstract:
Devising adaptive logics usually starts with a set of abnormalities and a deductive logic. Where the adaptive logic is ampliative, the deductive logic is the lower limit logic, the rules of which are unconditionally valid. Where the adaptive logic is corrective, the deductive logic is the upper limit logic, the rules of which are valid in case the premises do not require any abnormalities to be true. In some cases, the idea for devising an adaptive logic does not relate to a set of abnormalities, but to one or more defeasible rules, and perhaps also to one of the deductive logics. Defeasible r
APA, Harvard, Vancouver, ISO, and other styles
6

Thirumaran., M., E. Ilavarasan., K. Thanigaivel., and S. Abarna. "BUSINESS RULE MANAGEMENT FRAMEWORK FOR ENTERPRISE WEB SERVICES." International Journal on Web Service Computing (IJWSC) 1, no. 2 (2010): 15–29. https://doi.org/10.5281/zenodo.3936393.

Full text
Abstract:
Making a business rule extraction more dynamic is an open issue, and we think it is feasible if we decompose the business process structure in a set of rules, each of them representing a transition of the business process. As a consequence the business process engine can be realized by reusing and integrating an existing Rule Engine. We are proposing a way for extracting the business rules and then to modify it at the runtime. Business rules specifies the constraints that affect the behaviors and also specifies the derivation of conditions that affect the execution flow. The rules can be extra
APA, Harvard, Vancouver, ISO, and other styles
7

Thirumaran., M., E. Ilavarasan., K. Thanigaivel., and S. Abarna. "BUSINESS RULE MANAGEMENT FRAMEWORK FOR ENTERPRISE WEB SERVICES." International Journal on Web Service Computing (IJWSC) 1, no. 2 (2010): 15–29. https://doi.org/10.5281/zenodo.3345678.

Full text
Abstract:
Making a business rule extraction more dynamic is an open issue, and we think it is feasible if we decompose the business process structure in a set of rules, each of them representing a transition of the business process. As a consequence the business process engine can be realized by reusing and integrating an existing Rule Engine. We are proposing a way for extracting the business rules and then to modify it at the runtime. Business rules specifies the constraints that affect the behaviors and also specifies the derivation of conditions that affect the execution flow. The rules can be extra
APA, Harvard, Vancouver, ISO, and other styles
8

Jeřábek, Emil. "Canonical rules." Journal of Symbolic Logic 74, no. 4 (2009): 1171–205. http://dx.doi.org/10.2178/jsl/1254748686.

Full text
Abstract:
AbstractWe develop canonical rules capable of axiomatizing all systems of multiple-conclusion rules over K4 or IPC, by extension of the method of canonical formulas by Zakharyaschev [37]. We use the framework to give an alternative proof of the known analysis of admissible rules in basic transitive logics, which additionally yields the following dichotomy: any canonical rule is either admissible in the logic, or it is equivalent to an assumption-free rule. Other applications of canonical rules include a generalization of the Blok–Esakia theorem and the theory of modal companions to systems of
APA, Harvard, Vancouver, ISO, and other styles
9

MAHER, MICHAEL J. "Propositional defeasible logic has linear complexity." Theory and Practice of Logic Programming 1, no. 6 (2001): 691–711. http://dx.doi.org/10.1017/s1471068401001168.

Full text
Abstract:
Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts markedly with most other propositional nonmonotonic logics, in which inference is intractable.
APA, Harvard, Vancouver, ISO, and other styles
10

Kondratyev, Dmitry A. "Logic for reasoning about bugs in loops over data sequences (IFIL)." Modeling and Analysis of Information Systems 30, no. 3 (2023): 214–33. http://dx.doi.org/10.18255/1818-1015-2023-3-214-233.

Full text
Abstract:
Classic deductive verification is not focused on reasoning about program incorrectness. Reasoning about program incorrectness using formal methods is an important problem nowadays. Special logics such as Incorrectness Logic, Adversarial Logic, Local Completeness Logic, Exact Separation Logic and Outcome Logic have recently been proposed to address it. However, these logics have two disadvantages. One is that they are based on under-approximation approaches, while classic deductive verification is based on the over-approximation approach. One the other hand, the use of the classic approach requ
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "The rules of logic"

1

Plummer, David John. "Gazing : a technique for controlling the use of rewrite rules." Thesis, University of Edinburgh, 1988. http://hdl.handle.net/1842/19242.

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

Ramirez, Ortiz Rolando. "Circuit design rules for mixed static and dynamic CMOS logic circuits." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/NQ37076.pdf.

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

Ramirez, Ortiz Rolando Carleton University Dissertation Engineering Electronics. "Circuit design rules for mixed static and dynamics CMOS logic circuits." Ottawa, 1999.

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

Loomis, Eric John. "Meaning, generality, and rules : language and logic in the later Wittgenstein /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

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

Battell, Chelsea. "The Logic of Hereditary Harrop Formulas as a Specification Logic for Hybrid." Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35264.

Full text
Abstract:
Hybrid is a two-level logical framework that supports higher-order abstract syntax (HOAS), where a specification logic (SL) extends the class of object logics (OLs) we can reason about. We develop a new Hybrid SL and formalize its metatheory, proving weakening, contraction, exchange, and cut admissibility; results that greatly simplify reasoning about OLs in systems providing HOAS. The SL is a sequent calculus defined as an inductive type in Coq and we prove properties by structural induction over SL sequents. We also present a generalized SL and metatheory statement, allowing us to prove ma
APA, Harvard, Vancouver, ISO, and other styles
6

Gomes, Ana Sofia. "Derivation methods for hybrid knowledge bases with rules and ontologies." Master's thesis, FCT - UNL, 2009. http://hdl.handle.net/10362/2563.

Full text
Abstract:
Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática<br>First of all, I would like to thank my advisor, José Júlio Alferes, for his incredible support. Right from the start, during the first semester of this work, when we were 2700 km apart and meeting regularly via Skype, until the end of this dissertation, he was always committed and available for discussions, even when he had lots of other urgent things to do. A really special thanks to Terrance Swift, whom acted as an advisor, helping me a lo
APA, Harvard, Vancouver, ISO, and other styles
7

Morak, Michael. "The impact of disjunction on reasoning under existential rules." Thesis, University of Oxford, 2014. https://ora.ox.ac.uk/objects/uuid:b8f012c4-0210-41f6-a0d3-a9d1ea5f8fac.

Full text
Abstract:
Ontological database management systems are a powerful tool that combine traditional database techniques with ontological reasoning methods. In this setting, a classical extensional database is enriched with an ontology, or a set of logical assertions, that describe how new, intensional knowledge can be derived from the extensional data. Conjunctive queries are therefore answered against this combined knowledge base of extensional and intensional data. Many languages that represent ontologies have been introduced in the literature. In this thesis we will focus on existential rules (also called
APA, Harvard, Vancouver, ISO, and other styles
8

Lagerqvist, Victor. "A comparison of SL- and unit-resolution search rules for stratified logic programs." Thesis, Linköping University, TCSLAB - Theoretical Computer Science Laboratory, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57363.

Full text
Abstract:
<p>There are two symmetrical resolution rules applicable to logic programs - SL-resolution which yields a top-down refutation and unit-resolution which yields a bottom-up refutation. Both resolution principles need to be coupled with a search rule before they can be used in practice. The search rule determines in which order program clauses are used in the refutation and affects both performance, completeness and quality of solutions. The thesis surveys exhaustive and heuristic search rules for SL-resolution and transformation techniques for (general) logic programs that makes unit-resolution
APA, Harvard, Vancouver, ISO, and other styles
9

Mário, Oliveira Rodrigues Cleyton. "Component assembly and theorem proving in constraint handling rules." Universidade Federal de Pernambuco, 2009. https://repositorio.ufpe.br/handle/123456789/1821.

Full text
Abstract:
Made available in DSpace on 2014-06-12T15:52:36Z (GMT). No. of bitstreams: 1 license.txt: 1748 bytes, checksum: 8a4605be74aa9ea9d79846c1fba20a33 (MD5) Previous issue date: 2009<br>Devido á grande demanda por softwares cada vez mais robustos, complexos e flexíveis, e, sobretudo, pelo curtíssimo tempo de entrega exigido, a engenharia de software tem procurado novos meios de desenvolvimento que supram satisfatoriamente essas demandas. Uma forma de galgar esses novos patamares de produtividade provém do uso de uma metodologia baseada em agentes que se comunicam e com isso, ao invés dos prog
APA, Harvard, Vancouver, ISO, and other styles
10

Matthews, Stephen. "Learning lost temporal fuzzy association rules." Thesis, De Montfort University, 2012. http://hdl.handle.net/2086/8257.

Full text
Abstract:
Fuzzy association rule mining discovers patterns in transactions, such as shopping baskets in a supermarket, or Web page accesses by a visitor to a Web site. Temporal patterns can be present in fuzzy association rules because the underlying process generating the data can be dynamic. However, existing solutions may not discover all interesting patterns because of a previously unrecognised problem that is revealed in this thesis. The contextual meaning of fuzzy association rules changes because of the dynamic feature of data. The static fuzzy representation and traditional search method are ina
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "The rules of logic"

1

Faber, Wolfgang, and Adrian Paschke, eds. Reasoning Web. Web Logic Rules. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21768-0.

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

Hwang, P'ir-hong. Nolli ŭi kyuch'iktŭl: Logical rules. Tan'guk Taehakkyo Ch'ulp'anbu, 2011.

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

David, Braybrooke, ed. Social rules: Origin, character, logic, change. Westview Press, 1996.

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

E, Nisbett Richard, ed. Rules for reasoning. L. Erlbaum Associates, 1993.

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

Naur, Peter. Knowing and the Mystique of Logic and Rules. Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-015-8549-1.

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

Console, Marco, and Boris Konev, eds. Reasoning Web. Declarative Artificial Intelligence: Knowledge, Rules, Logic. Springer Nature Switzerland, 2025. https://doi.org/10.1007/978-3-031-80283-6.

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

Royakkers, Lambèr M. M. Extending Deontic Logic for the Formalisation of Legal Rules. Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-015-9099-0.

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

Royakkers, Lambèr M. M. Extending Deontic Logic for the Formalisation of Legal Rules. Springer Netherlands, 1998.

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

Royakkers, Lambèr M. M. Extending deontic logic for the formalisation of legal rules. Kluwer Academic Publishers, 1998.

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

Markov, Sergey. Logic, second edition. 2nd ed. Publishing Center RIOR, 2024. http://dx.doi.org/10.29039/01957-3.

Full text
Abstract:
In the textbook, written in accordance with the Federal State Educational Standard for Higher Education and intended for university students (primarily in the humanities and specialties), logic is considered as a methodological basis and a tool for logically correct thinking. Topics for study include logical rules for dividing the scope of a concept, classification, topics of definitions of terms, logical rules for constructing normative statements, logic of questions and answers, rules and techniques of inference, hypothetico-deductive method, syllogistics, as well as other materials useful f
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "The rules of logic"

1

Trudel, John W., and Lloyd D. Fisher. "Logic Rules!" In Health Informatics. Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-4327-7_6.

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

Dijkstra, Atze, and S. Doaitse Swierstra. "Ruler: Programming Type Rules." In Functional and Logic Programming. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11737414_4.

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

Schrijvers, Tom. "Constraint Handling Rules." In Logic Programming. Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89982-2_3.

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

Lover, Robert. "Rules of Inference." In Elementary Logic. Springer London, 2008. http://dx.doi.org/10.1007/978-1-84800-082-7_16.

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

Hage, Jaap C. "Reason-Based Logic." In Reasoning with Rules. Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8873-7_4.

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

Peregrin, Jaroslav. "Rules of Logic." In Inferentialism. Palgrave Macmillan UK, 2014. http://dx.doi.org/10.1057/9781137452962_10.

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

Pettorossi, Alberto, and Maurizio Proietti. "Program Derivation = Rules + Strategies." In Computational Logic: Logic Programming and Beyond. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45628-7_12.

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

Woleński, Jan. "Rule-Following and Logic." In Problems of Normativity, Rules and Rule-Following. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09375-8_29.

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

Laurent, D., and Ch Vrain. "Learning query rules for optimizing databases with update rules." In Logic in Databases. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0031740.

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

Ramirez, Rafael. "Inducing Musical Rules with ILP." In Logic Programming. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-24599-5_43.

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

Conference papers on the topic "The rules of logic"

1

Savell, C. Thomas, Bob Baboian, Russ Kane, et al. "Intelligent Agents for Corrosion Prevention in New Vehicle Design." In CORROSION 2003. NACE International, 2003. https://doi.org/10.5006/c2003-03218.

Full text
Abstract:
Abstract This paper describes the development of an expert tool for vehicle design that assists the designer in avoiding bad design decisions, which may cause corrosion problems during the life of the vehicle. The tool is an autonomous agent installed as part of designer's CAD/CAE system. It uses a Hybrid Expert Production System containing Rules in its Knowledge Base and both an Inference Engine that compares these stored Rules with the information (Facts) provided by the designer and CAD/CAE software and a Bayesian Network for processing uncertainty in the facts and rules. An important enhan
APA, Harvard, Vancouver, ISO, and other styles
2

Savell, C. T., and P. A. Decker. "Corrosion Expert Tool for Vehicle Design." In CORROSION 2002. NACE International, 2002. https://doi.org/10.5006/c2002-02156.

Full text
Abstract:
Abstract This paper describes the development of an expert tool for vehicle design that assists the designer in avoiding bad design decisions, which may cause corrosion problems during the life of the vehicle. The tool is an autonomous agent installed as part of designer's CAD/CAE system. It uses an AI Expert Production System containing Rules in its Knowledge Base and an Inference Engine that compares these stored Rules with the information (Facts) provided by the designer and CAD/CAE software. An important enhancement in this system not found in most Expert Systems is an Uncertainty Processo
APA, Harvard, Vancouver, ISO, and other styles
3

Krotzsch, Markus, Pascal Hitzler, Denny Vrandecic, and Michael Sintek. "How to reason with OWL in a logic programming system." In 2006 2nd International Conference on Rules and Rule Markup Languages for the Semantic Web. IEEE, 2006. http://dx.doi.org/10.1109/ruleml.2006.14.

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

Heymans, Stijn, Roman Korf, Michael Erdmann, Jorg Puhrer, and Thomas Eiter. "F-Logic#: Loosely Coupling F-Logic Rules and Ontologies." In 2010 IEEE/ACM International Conference on Web Intelligence-Intelligent Agent Technology (WI-IAT). IEEE, 2010. http://dx.doi.org/10.1109/wi-iat.2010.44.

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

Chirila, Ciprian-Bogdan, Calin Jebelean, Gunter Kniesel, and Philippe Lahire. "Generic rules for logic representation transformations." In 2010 IEEE International Conference on Automation, Quality and Testing, Robotics (AQTR 2010). IEEE, 2010. http://dx.doi.org/10.1109/aqtr.2010.5520663.

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

Carral, David, and Markus Krötzsch. "Rewriting the Description Logic ALCHIQ to Disjunctive Existential Rules." 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/246.

Full text
Abstract:
Especially in data-intensive settings, a promising reasoning approach for description logics (DLs) is to rewrite DL theories into sets of rules. Although many such approaches have been considered in the literature, there are still various relevant DLs for which no small rewriting (of polynomial size) is known. We therefore develop small rewritings for the DL \ALCHIQ -- featuring disjunction, number restrictions, and inverse roles -- to disjunctive Datalog. By admitting existential quantifiers in rule heads, we can improve this result to yield only rules of bounded size, a property that is comm
APA, Harvard, Vancouver, ISO, and other styles
7

Gill, Amaninder Singh, and Chiradeep Sen. "Logic Rules for Automated Synthesis of Function Models Using Evolutionary Algorithms." In ASME 2021 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/detc2021-70575.

Full text
Abstract:
Abstract This paper presents the development of logic rules for evaluating the fitness of function models synthesized by an evolutionary algorithm. A set of 65 rules for twelve different function verbs are developed. The rules are abstractions of the definitions of the verbs in their original vocabularies and are stated as constraints on the quantity, type, and topology of flows connected to the functions. The rules serve as an objective and unambiguous basis of evaluating the fitness of function models developed by a genetic algorithm. The said algorithm and the rules are implemented in softw
APA, Harvard, Vancouver, ISO, and other styles
8

Hu, Zhiting, Xuezhe Ma, Zhengzhong Liu, Eduard Hovy, and Eric Xing. "Harnessing Deep Neural Networks with Logic Rules." In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Association for Computational Linguistics, 2016. http://dx.doi.org/10.18653/v1/p16-1228.

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

Murinová, Petra, Viktor Pavliska, and Michal Burda. "Generalized Peterson’s Rules in Fuzzy Natural Logic." In 19th World Congress of the International Fuzzy Systems Association (IFSA), 12th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT), and 11th International Summer School on Aggregation Operators (AGOP). Atlantis Press, 2021. http://dx.doi.org/10.2991/asum.k.210827.051.

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

Szatkowska, Małgorzata, Oleg A. Khorozov, Iurii V. Krak, Veda S. Kasianiuk, and Kalamkas Begaliyeva. "Vital signs monitoring using fuzzy logic rules." In Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2018, edited by Ryszard S. Romaniuk and Maciej Linczuk. SPIE, 2018. http://dx.doi.org/10.1117/12.2501585.

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

Reports on the topic "The rules of logic"

1

Tang, Yu, and Kung C. Wu. Active structural control by fuzzy logic rules: An introduction. Office of Scientific and Technical Information (OSTI), 1996. http://dx.doi.org/10.2172/448036.

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

Tang, Y. Active structural control by fuzzy logic rules: An introduction. Office of Scientific and Technical Information (OSTI), 1995. http://dx.doi.org/10.2172/123263.

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

Palmer, John M. Using Fuzzy Logic in Evaluating User Tabled Correlation Rules for COMINT. Defense Technical Information Center, 2000. http://dx.doi.org/10.21236/ada394698.

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

Baader, Franz, and Barbara Morawska. Matching with respect to general concept inclusions in the Description Logic EL. Technische Universität Dresden, 2014. http://dx.doi.org/10.25368/2022.205.

Full text
Abstract:
Matching concept descriptions against concept patterns was introduced as a new inference task in Description Logics (DLs) almost 20 years ago, motivated by applications in the Classic system. For the DL EL, it was shown in 2000 that the matching problem is NP-complete. It then took almost 10 years before this NP-completeness result could be extended from matching to unification in EL. The next big challenge was then to further extend these results from matching and unification without a TBox to matching and unification w.r.t. a general TBox, i.e., a finite set of general concept inclusions. Fo
APA, Harvard, Vancouver, ISO, and other styles
5

Kriegel, Francesco. Learning description logic axioms from discrete probability distributions over description graphs (Extended Version). Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.247.

Full text
Abstract:
Description logics in their standard setting only allow for representing and reasoning with crisp knowledge without any degree of uncertainty. Of course, this is a serious shortcoming for use cases where it is impossible to perfectly determine the truth of a statement. For resolving this expressivity restriction, probabilistic variants of description logics have been introduced. Their model-theoretic semantics is built upon so-called probabilistic interpretations, that is, families of directed graphs the vertices and edges of which are labeled and for which there exists a probability measure o
APA, Harvard, Vancouver, ISO, and other styles
6

Sgurev, Vassil. Inference Rules, Degrees of Truthfulness and Tautologies in Multivalued Hierarchical Logic with One Real and Two Imaginary Logical Structures. "Prof. Marin Drinov" Publishing House of Bulgarian Academy of Sciences, 2021. http://dx.doi.org/10.7546/crabs.2021.12.10.

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

Trotter, J. D., and A. K. R. Naini. Bulk CMOS VLSI Technology Studies. Part 1. Scalable CMOS Design Rules. Part 2. CMOS Approaches to PLA (Programmable Logic Array) Design. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada158367.

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

Borgwardt, Stefan. Concise Justifications Versus Detailed Proofs for Description Logic Entailments. Technische Universität Dresden, 2021. http://dx.doi.org/10.25368/2023.225.

Full text
Abstract:
We discuss explanations in Description Logics (DLs), a family of logics used for knowledge representation. Initial work on explaining consequences for DLs had focused on justifications, which are minimal subsets of axioms that entail the consequence. More recently, it was proposed that proofs can provide more detailed information about why a consequence follows. Moreover, several measures have been proposed to estimate the comprehensibility of justifications and proofs, for example, their size or the complexity of logical expressions. In this paper, we analyze the connection between these meas
APA, Harvard, Vancouver, ISO, and other styles
9

Paule, Bernard, Flourentzos Flourentzou, Tristan de KERCHOVE d’EXAERDE, Julien BOUTILLIER, and Nicolo Ferrari. PRELUDE Roadmap for Building Renovation: set of rules for renovation actions to optimize building energy performance. Department of the Built Environment, 2023. http://dx.doi.org/10.54337/aau541614638.

Full text
Abstract:
In the context of climate change and the environmental and energy constraints we face, it is essential to develop methods to encourage the implementation of efficient solutions for building renovation. One of the objectives of the European PRELUDE project [1] is to develop a "Building Renovation Roadmap"(BRR) aimed at facilitating decision-making to foster the most efficient refurbishment actions, the implementation of innovative solutions and the promotion of renewable energy sources in the renovation process of existing buildings. In this context, Estia is working on the development of infer
APA, Harvard, Vancouver, ISO, and other styles
10

Tsidylo, Ivan M., Serhiy O. Semerikov, Tetiana I. Gargula, Hanna V. Solonetska, Yaroslav P. Zamora, and Andrey V. Pikilnyak. Simulation of intellectual system for evaluation of multilevel test tasks on the basis of fuzzy logic. CEUR Workshop Proceedings, 2021. http://dx.doi.org/10.31812/123456789/4370.

Full text
Abstract:
The article describes the stages of modeling an intelligent system for evaluating multilevel test tasks based on fuzzy logic in the MATLAB application package, namely the Fuzzy Logic Toolbox. The analysis of existing approaches to fuzzy assessment of test methods, their advantages and disadvantages is given. The considered methods for assessing students are presented in the general case by two methods: using fuzzy sets and corresponding membership functions; fuzzy estimation method and generalized fuzzy estimation method. In the present work, the Sugeno production model is used as the closest
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'The rules of logic' 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