Relevant bibliographies by topics / Logic

Academic literature on the topic 'Logic'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 July 2024

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic '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 "Logic"

1

Holba, Jiří. "Buddhismus a aristotelská logika." FILOSOFIE DNES 3, no. 1 (June 17, 2011): 27–36. http://dx.doi.org/10.26806/fd.v3i1.60.

Full text
Abstract:
Abstrakt/Abstract Článek pojednává o buddhistické logice a jejím vztahu k logice aristotelské, zejména k principu sporu a principu vyloučeného třetího. Dotkne se také dialetheismu a parakonzistentních logik, které se v souvislosti s interpretacemi buddhismu objevují. The article deals with the Buddhist logic and its relation to Aristotle’s logic, in particular, to the principle of non-contradiction and the principle of exluded middle. It also tackles the topic of dialetheism and paraconsistent logics, which are sometimes mentioned in connection with the interpretations of Buddhism.
APA, Harvard, Vancouver, ISO, and other styles
2

Holba, Jiří. "Buddhismus a aristotelská logika." FILOSOFIE DNES 3, no. 1 (June 17, 2011): 27–36. http://dx.doi.org/10.26806/fd.v3i1.325.

Full text
Abstract:
Abstrakt/Abstract Článek pojednává o buddhistické logice a jejím vztahu k logice aristotelské, zejména k principu sporu a principu vyloučeného třetího. Dotkne se také dialetheismu a parakonzistentních logik, které se v souvislosti s interpretacemi buddhismu objevují. The article deals with the Buddhist logic and its relation to Aristotle’s logic, in particular, to the principle of non-contradiction and the principle of exluded middle. It also tackles the topic of dialetheism and paraconsistent logics, which are sometimes mentioned in connection with the interpretations of Buddhism.
APA, Harvard, Vancouver, ISO, and other styles
3

Lewitzka, Steffen. "Abstract Logics, Logic Maps, and Logic Homomorphisms." Logica Universalis 1, no. 2 (August 8, 2007): 243–76. http://dx.doi.org/10.1007/s11787-007-0013-z.

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

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

Full text
Abstract:
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 studied is the paraconsistent, that is, the reasoning that tolerates contradictions. However, although there are many paraconsistent logics with different types of semantics, their application to logic programming is more delicate than it first appears, requiring an in-depth study of what can or cannot be transferred directly from classical first-order logic to other types of logic.Based on studies of Tarcisio Rodrigues on the foundations of Paraconsistent Logic Programming (2010) for some Logics of Formal Inconsistency (LFIs), this thesis intends to resume the research of Rodrigues and place it in the specific context of LFIs with three- and four-valued semantics. This kind of logics are interesting from the computational point of view, as presented by Luiz Silvestrini in his Ph.D. thesis entitled “A new approach to the concept of quase-truth” (2011), and by Marcelo Coniglio and Martín Figallo in the article “Hilbert-style presentations of two logics associated to tetravalent modal algebras” [Studia Logica (2012)]. Based on original techniques, this study aims to define well-founded systems of paraconsistent logic programming based on well-known logics, in contrast to the ad hoc approaches to this question found in the literature.Abstract prepared by Kleidson Êglicio Carvalho da Silva Oliveira.E-mail: kecso10@yahoo.com.brURL: http://repositorio.unicamp.br/jspui/handle/REPOSIP/322632
APA, Harvard, Vancouver, ISO, and other styles
5

Tulenheimo, Tero. "Three Nordic Neo-Aristotelians and the First Doorkeeper of Logic." Studia Neoaristotelica 19, no. 1 (2022): 3–106. http://dx.doi.org/10.5840/studneoar20221911.

Full text
Abstract:
I discuss the views on logic held by three early Nordic neo-Aristotelians — the Swedes Johannes Canuti Lenaeus (1573–1669) and Johannes Rudbeckius (1581–1646), and the Dane Caspar Bartholin (1585–1629). They all studied in Wittenberg (enrolled respectively in 1597, 1601, and 1604) and were exponents of protestant (Lutheran) scholasticism. The works I utilize are Janitores logici bini (1607) and Enchiridion logicum (1608) by Bartholin; Logica (1625) and Controversiae logices (1629) by Rudbeckius; and Logica peripatetica (1633) by Lenaeus. Rudbeckius’s and Lenaeus’s books were published much later than they were prepared. Rudbeckius wrote the first versions of his books in 1606, and the material for Lenaeus’s book had been prepared by 1607. Bartholin calls the treatment of the nature of logic the “first doorkeeper of logic”. To compare the views of the three neo-Aristotelians on this topic, I systematically investigate what they have to say about second notions, the subject of logic, the internal and external goal of logic, and the definition of logic. I also compare their approaches with those of Jacob Martini (teacher of Rudbeckius and Bartholin) and Iacopo Zabarella (an intellectual predecessor of all three).
APA, Harvard, Vancouver, ISO, and other styles
6

Feferman, Solomon. "Logic, Logics, and Logicism." Notre Dame Journal of Formal Logic 40, no. 1 (January 1999): 31–54. http://dx.doi.org/10.1305/ndjfl/1039096304.

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

Mott, Peter. "Default non-monotonic logic." Knowledge Engineering Review 3, no. 4 (December 1988): 265–84. http://dx.doi.org/10.1017/s0269888900004586.

Full text
Abstract:
AbstractThis paper is a review of certain non-monotonic logics, which I call default non-monotonic logics. These are logics which exploit failure to prove. How each logic uses this basic idea is explained, and examples given. The emphasis is on leading ideas explained through examples: technical detail is avoided. Four non-monotonic logics are discussed: Reiter's default logic, McCarthy's circumscription, McDermott's modal non-monotonic logic, and Clarks's completed database. The first two are treated in some detail. The recent Hanks-McDermott criticism of non-monotonic logic is discussed, and some conclusions drawn about the prospects for non-monotonic logic. Recommendations for further reading are given.
APA, Harvard, Vancouver, ISO, and other styles
8

Francez, Nissim. "Bilateral Connexive Logic." Logics 1, no. 3 (August 4, 2023): 157–62. http://dx.doi.org/10.3390/logics1030008.

Full text
Abstract:
This paper proposes a bilateral analysis of connexivity, presenting a bilateral natural deduction system for a weak connexive logic. The proposed logic deviates from other connexive logics and other bilateral logics in the following respects: (1) The logic induces a difference in meaning between inner and outer occurrences of negation in the connexive axioms. (2) The logic allows incoherence—assertion and denial of the same formula—while still being non-trivial.
APA, Harvard, Vancouver, ISO, and other styles
9

Golan, Rea, and Ulf Hlobil. "Minimally Nonstandard K3 and FDE." Australasian Journal of Logic 19, no. 5 (December 20, 2022): 182–213. http://dx.doi.org/10.26686/ajl.v19i5.7540.

Full text
Abstract:
Graham Priest has formulated the minimally inconsistent logic of paradox (MiLP), which is paraconsistent like Priest’s logic of paradox (LP), while staying closer to classical logic. We present logics that stand to (the propositional fragments of) strong Kleene logic (K3) and the logic of first-degree entailment (FDE) as MiLP stands to LP. That is, our logics share the paracomplete and the paraconsistent-cum-paracomplete nature of K3 and FDE, respectively, while keeping these features to a minimum in order to stay closer to classical logic. We give semantic and sequent-calculus formulations of these logics, and we highlight some reasons why these logics may be interesting in their own right.
APA, Harvard, Vancouver, ISO, and other styles
10

MA, MINGHUI, and HANS VAN DITMARSCH. "DYNAMIC GRADED EPISTEMIC LOGIC." Review of Symbolic Logic 12, no. 4 (July 12, 2019): 663–84. http://dx.doi.org/10.1017/s1755020319000285.

Full text
Abstract:
AbstractGraded epistemic logic is a logic for reasoning about uncertainties. Graded epistemic logic is interpreted on graded models. These models are generalizations of Kripke models. We obtain completeness of some graded epistemic logics. We further develop dynamic extensions of graded epistemic logics, along the framework of dynamic epistemic logic. We give an extension with public announcements, i.e., public events, and an extension with graded event models, a generalization also including nonpublic events. We present complete axiomatizations for both logics.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Logic"

1

Zhu, Biao. "Logic programming framework for resolution logics." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0006/MQ43411.pdf.

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

Rabe, Florian [Verfasser]. "Representing logics and logic translations / Florian Rabe." Bremen : IRC-Library, Information Resource Center der Jacobs University Bremen, 2009. http://d-nb.info/103498439X/34.

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

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

Full text
Abstract:
This thesis discusses some central aspects of Wittgenstein’s conception of language and logic in his Tractatus Logico-Philosophicus and brings them into relation with the philosophies of Frege and Russell. The main contention is that a fruitful way of understanding the Tractatus is to see it as responding to tensions in Frege’s conception of logic and Russell’s theory of judgement. In the thesis the philosophy of the Tractatus is presented as developing from these two strands of criticism and thus as the culmination of the philosophy of logic and language developed in the early analytic period. Part one examines relevant features of Frege’s philosophy of logic. Besides shedding light on Frege’s philosophy in its own right, it aims at preparing the ground for a discussion of those aspects of the Tractatus’ conception of logic which derive from Wittgenstein’s critical response to Frege. Part two first presents Russell’s early view on truth and judgement, before considering several variants of the multiple relation theory of judgement, devised in opposition to it. Part three discusses the development of Wittgenstein’s conception of language and logic, beginning with Wittgenstein’s criticism of the multiple relation theory and his early theory of sense, seen as containing the seeds of the picture theory of propositions presented in the Tractatus. I then consider the relation between Wittgenstein’s pictorial conception of language and his conception of logic, arguing that Wittgenstein’s understanding of sense in terms of bipolarity grounds his view of logical complexity and of the essence of logic as a whole. This view, I show, is free from the internal tensions that affect Frege’s understanding of the nature of logic.
APA, Harvard, Vancouver, ISO, and other styles
4

Friend, Michèle Indira. "Second-order logic is logic." Thesis, University of St Andrews, 1997. http://hdl.handle.net/10023/14753.

Full text
Abstract:
"Second-order logic" is the name given to a formal system. Some claim that the formal system is a logical system. Others claim that it is a mathematical system. In the thesis, I examine these claims in the light of some philosophical criteria which first motivated Frege in his logicist project. The criteria are that a logic should be universal, it should reflect our intuitive notion of logical validity, and it should be analytic. The analysis is interesting in two respects. One is conceptual: it gives us a purchase on where and how to draw a distinction between logic and other sciences. The other interest is historical: showing that second-order logic is a logical system according to the philosophical criteria mentioned above goes some way towards vindicating Frege's logicist project in a contemporary context.
APA, Harvard, Vancouver, ISO, and other styles
5

Nguyen, Loc Bao. "Logic design using programmable logic devices." PDXScholar, 1988. https://pdxscholar.library.pdx.edu/open_access_etds/4103.

Full text
Abstract:
The Programmable Logic Devices, PLO, have caused a major impact in logic design of digital systems in this decade. For instance, a twenty pin PLO device can replace from three hundreds to six hundreds Transistor Transistor Logic gates, which people have designed with since the 60s. Therefore, by using PLD devices, designers can squeeze more features, reduce chip counts, reduce power consumption, and enhance the reliability of the digital systems. This thesis covers the most important aspects of logic design using PLD devices. They are Logic Minimization and State Assignment. In addition, the thesis also covers a seldomly used but very useful design style, Self-Synchronized Circuits. The thesis introduces a new method to minimize Two-Level Boolean Functions using Graph Coloring Algorithms and the result is very encouraging. The raw speed of the coloring algorithms is as fast as the Espresso, the industry standard minimizer from Berkeley, and the solution is equally good. The thesis also introduces a rule-based state assignment method which gives equal or better solutions than STASH (an Intel Automatic CAD tool) by as much as twenty percent. One of the problems with Self-Synchronized circuits is that it takes many extra components to implement the circuit. The thesis shows how it can be designed using PLD devices and also suggests the idea of a Clock Chip to reduce the chip count to make the design style more attractive.
APA, Harvard, Vancouver, ISO, and other styles
6

Sack, Joshua. "Adding temporal logic to dynamic epistemic logic." [Bloomington, Ind.] : Indiana University, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3274928.

Full text
Abstract:
Thesis (Ph.D.)--Indiana University, Dept. of Mathematics, 2007.
Source: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4531. Adviser: Lawrence Moss. Title from dissertation home page (viewed Apr. 22, 2008).
APA, Harvard, Vancouver, ISO, and other styles
7

Veen, Maria Helena van der. "[Pi]-Logic." [S.l. : Groningen : s.n. ; University Library Groningen] [Host], 2006. http://irs.ub.rug.nl/ppn/293902518.

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

Merrison, Joanne. "Coleridge's logic." Thesis, University of East Anglia, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316092.

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

Wheelhouse, Mark James. "Segment logic." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/10473.

Full text
Abstract:
O'Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data structures using separation logic. They reason about the local parts of the memory accessed by programs, and thus construct their smallest complete specifications. Gardner et al. generalised their work, using context logic to reason about structured data at the same level of abstraction as the data itself. In particular, we developed a formal specification of the Document Object Model (DOM), a W3C XML update library. Whilst we kept to the spirit of local reasoning, we were not able to retain small specifications for all of the commands of DOM: for example, our specification of the appendChild command was not small. We show how to obtain such small specifications by developing a more fine-grained context structure, allowing us to work with arbitrary segments of a data structure. We introduce segment logic, a logic for reasoning about such segmented data structures, staring at first with a simple tree structure, but then showing how to generalise our approach to arbitrary structured data. Using our generalised segment logic we construct a reasoning framework for abstract program modules, showing how to reason about such modules at the client level. In particular we look at modules for trees, lists, heaps and the more complex data model of DOM. An important part of any abstraction technique is an understanding of how to link the abstraction back to concrete implementations. Building on our previous abstraction and refinement work for local reasoning, we show how to soundly implement the segment models used in our abstract reasoning. In particular we show how to implement our fine-grained list and tree modules so that their abstract specifications are satisfied by the concrete implementations. We also show how our reasoning from the abstract level can be translated to reasoning at the concrete level. Finally, we turn our attention to concurrency and show how having genuine small axioms for our commands allows for a simple treatment of abstract level concurrency constructs.
APA, Harvard, Vancouver, ISO, and other styles
10

Roşu, Grigore. "Hidden logic /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2000. http://wwwlib.umi.com/cr/ucsd/fullcit?p9979966.

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

Books on the topic "Logic"

1

Neblett, William. Sherlock's logic. Lanham, MD: University Press of America, 1985.

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

Boolos, George. Logic, logic, and logic. Cambridge, Mass: Harvard University Press, 1998.

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

Gabbay, Dov M. Handbook of Philosophical Logic: Volume 16. Dordrecht: Springer Science+Business Media B.V., 2011.

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

Copi, Irving M. Introduction to logic. Upper Saddle River, N.J: Pearson/Prentice Hall, 2005.

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

Copi, Irving M. Introduction to logic. Upper Saddle River, N.J: Pearson/Prentice Hall, 2009.

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

Copi, Irving M. Introduction to logic. 8th ed. New York: Macmillan, 1990.

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

Copi, Irving M. Introduction to logic. 9th ed. New York: Macmillan Pub., 1994.

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

Copi, Irving M. Introduction to logic. 9th ed. New York: Macmillan Pub., 1994.

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

Copi, Irving M. Introduction to logic. Upper Saddle River, N.J: Pearson/Prentice Hall, 2009.

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

Copi, Irving M. Introduction to logic. 7th ed. New York: Macmillan, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Logic"

1

Hájek, Petr. "Product Logic, Gödel Logic (and Boolean Logic)." In Trends in Logic, 89–107. Dordrecht: Springer Netherlands, 1998. http://dx.doi.org/10.1007/978-94-011-5300-3_4.

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

Blair, J. Anthony. "Informal Logic and Logic." In Argumentation Library, 119–32. Dordrecht: Springer Netherlands, 2011. http://dx.doi.org/10.1007/978-94-007-2363-4_10.

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

Kontchakov, Roman, Agi Kurucz, Frank Wolter, and Michael Zakharyaschev. "Spatial Logic + Temporal Logic = ?" In Handbook of Spatial Logics, 497–564. Dordrecht: Springer Netherlands, 2007. http://dx.doi.org/10.1007/978-1-4020-5587-4_9.

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

Hájek, Petr. "Fuzzy Logic as Logic." In Mathematical Models for Handling Partial Knowledge in Artificial Intelligence, 21–30. Boston, MA: Springer US, 1995. http://dx.doi.org/10.1007/978-1-4899-1424-8_2.

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

Silvestre, Ricardo Sousa. "Philosophical Logic = Philosophy + Logic?" In Studies in Universal Logic, 281–301. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-94452-0_15.

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

Elahi, Ata. "Boolean Logics and Logic Gates." In Computer Systems, 29–45. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66775-1_2.

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

Elahi, Ata. "Boolean Logics and Logic Gates." In Computer Systems, 33–50. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-93449-1_2.

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

Šimkus, Mantas. "Fusion of Logic Programming and Description Logics." In Logic Programming, 551–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02846-5_59.

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

Yeap, Gary. "Logic." In Practical Low Power Digital VLSI Design, 117–38. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-6065-4_5.

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

Grattan-Guinness, Ivor, and Gérard Bornet. "Logic." In Science Networks. Historical Studies, 126–53. Basel: Birkhäuser Basel, 1997. http://dx.doi.org/10.1007/978-3-0348-8859-2_11.

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

Conference papers on the topic "Logic"

1

Kang, Han-Ok, and Cheon-Tae Park. "Option Study on a Steam Pressure Control Logic for SMART." In 16th International Conference on Nuclear Engineering. ASMEDC, 2008. http://dx.doi.org/10.1115/icone16-48217.

Full text
Abstract:
Design features of SMART such as a large coolant inventory with a relatively low flow rate and the existence of a once-through steam generator require new steam control logic capable of coping with a prompt load change without inducing severe operational parameter fluctuations. A new MMS SMART model was developed to study the load-following capability and the system parameter manageability of three candidate control logics: the reactor leading, the turbine leading, and the feedwater leading logics. The MMS SMART model was composed of several interacting MMS modules with numerical data, each of which represented a component of the SMART plant and control logic. The Reactor Coolant System, and the Steam and Power Conversion System with their control logics were modeled using default modules such as a pipe, a pump, and a tank. The candidate control logics had been implemented in the model and their dynamic characteristics for the case of a 100%-50%-100% load-following operation with a 25%/min rate were examined. With the reactor-leading control logic implemented, the turbine power was changed with a considerable time delay, which was mainly due to coolant temperature signal retardation to the feedwater controller. The steam pressure variation was very limited for the reactor-leading control logic. With the turbine-leading control logic, the turbine power was manipulated well to match the reference value, whereas relatively large fluctuations of the steam pressure and the coolant temperature occurred. The steam pressure swung with a comparatively large amplitude and the peak value of the fluctuation was not reduced even with larger gain values of the PI controller. This steam pressure swing was considerably decreased with the feedwater leading control logic, while the reactor power and the coolant temperatures had similar trends to those of the turbine leading control logic.
APA, Harvard, Vancouver, ISO, and other styles
2

Lu, Xu, Cong Tian, and Zhenhua Duan. "Temporalising Separation Logic for Planning with Search Control Knowledge." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/162.

Full text
Abstract:
Temporal logics are widely adopted in Artificial Intelligence (AI) planning for specifying Search Control Knowledge (SCK). However, traditional temporal logics are limited in expressive power since they are unable to express spatial constraints which are as important as temporal ones in many planning domains. To this end, we propose a two-dimensional (spatial and temporal) logic namely PPTL^SL by temporalising separation logic with Propositional Projection Temporal Logic (PPTL). The new logic is well-suited for specifying SCK containing both spatial and temporal constraints which are useful in AI planning. We show that PPTL^SL is decidable and present a decision procedure. With this basis, a planner namely S-TSolver for computing plans based on the spatio-temporal SCK expressed in PPTL^SL formulas is developed. Evaluation on some selected benchmark domains shows the effectiveness of S-TSolver.
APA, Harvard, Vancouver, ISO, and other styles
3

Quaiyum Ansari, Abdul. "Keynote speakers: From fuzzy logic to neutrosophic logic: A paradigme shift and logics." In 2017 International Conference on Intelligent Communication and Computational Techniques (ICCT). IEEE, 2017. http://dx.doi.org/10.1109/intelcct.2017.8324067.

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

Belardinelli, Francesco, Alessio Lomuscio, Aniello Murano, and Sasha Rubin. "Alternating-time Temporal Logic on Finite Traces." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/11.

Full text
Abstract:
We develop a logic-based technique to analyse finite interactions in multi-agent systems. We introduce a semantics for Alternating-time Temporal Logic (for both perfect and imperfect recall) and its branching-time fragments in which paths are finite instead of infinite. We study validities of these logics and present optimal algorithms for their model-checking problems in the perfect recall case.
APA, Harvard, Vancouver, ISO, and other styles
5

Benevides, Mario Folhadela, and Isaque Macalam Saab Lima. "Dynamic Epistemic Logic with Assignments, Concurrency and Communication Actions." In Workshop Brasileiro de Lógica. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/wbl.2020.11455.

Full text
Abstract:
This work proposes an extension of Dynamic Epistemic Logic with Communication Actions by adding the notion of postconditions from Dynamic Epistemic Logic with Assigments to deal with boolean assignments to action models. Other concurrent logics, like Concurrent Epistemic Action Logic introduced by Ditmarsch, Hoek and Kooi, do not deal with boolean assignments. We present an axiomatization and show that the proof of soundness, completeness and decidability can be done using a reduction method.
APA, Harvard, Vancouver, ISO, and other styles
6

Herzig, Andreas, Frédéric Maris, and Elise Perrotin. "A Dynamic Epistemic Logic with Finite Iteration and Parallel Composition." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/68.

Full text
Abstract:
Existing dynamic epistemic logics combine standard epistemic logic with a restricted version of dynamic logic. Instead, we here combine a restricted epistemic logic with a rich version of dynamic logic. The epistemic logic is based on `knowing-whether' operators and basically disallows disjunctions and conjunctions in their scope; it moreover captures `knowing-what'. The dynamic logic has not only all the standard program operators of Propositional Dynamic Logic, but also parallel composition as well as an operator of inclusive nondeterministic composition; its atomic programs are assignments of propositional variables. We show that the resulting dynamic epistemic logic is powerful enough to capture several kinds of sequential and parallel planning, and so both in the unbounded and in the finite horizon version.
APA, Harvard, Vancouver, ISO, and other styles
7

Tanida, J., and Y. Ichioka. "OPALS: Optical Parallel Array Logic System." In Optical Computing. Washington, D.C.: Optica Publishing Group, 1985. http://dx.doi.org/10.1364/optcomp.1985.tua4.

Full text
Abstract:
A novel optical digital computing system called Optical Parallel Array Logic System (OPALS) is presented, which can execute cellular logic1 in parallel. The system is constructed on the basis of the concept of optical array logic. The pure optical version of the OPALS can be realized by using a dynamic optical coding technique and optical correlation by a multi-focus imaging system. Although the OPALS is still a conceptual system, it would be expected to be a prototype of optical digital computing systems in future.
APA, Harvard, Vancouver, ISO, and other styles
8

Wild, Paul, and Lutz Schröder. "A Characterization Theorem for a Modal Description Logic." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/181.

Full text
Abstract:
Modal description logics feature modalities that capture dependence of knowledge on parameters such as time, place, or the information state of agents. E.g., the logic S5-ALC combines the standard description logic ALC with an S5-modality that can be understood as an epistemic operator or as representing (undirected) change. This logic embeds into a corresponding modal first-order logic S5-FOL. We prove a modal characterization theorem for this embedding, in analogy to results by van Benthem and Rosen relating ALC to standard first-order logic: We show that S5-ALC with only local roles is, both over finite and over unrestricted models, precisely the bisimulation-invariant fragment of S5-FOL, thus giving an exact description of the expressive power of S5-ALC with only local roles.
APA, Harvard, Vancouver, ISO, and other styles
9

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.

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

"EPISODIC LOGIC: NATURAL LOGIC + REASONING." In International Conference on Knowledge Engineering and Ontology Development. SciTePress - Science and and Technology Publications, 2011. http://dx.doi.org/10.5220/0003690003040310.

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

Reports on the topic "Logic"

1

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

Full text
Abstract:
Abstraction Logic is introduced as a foundation for Practical Types and Practal. It combines the simplicity of first-order logic with direct support for variable binding constants called abstractions. It also allows free variables to depend on parameters, which means that first-order axiom schemata can be encoded as simple axioms. Conceptually abstraction logic is situated between first-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 in between and beyond.
APA, Harvard, Vancouver, ISO, and other styles
2

Nguyen, Loc. Logic design using programmable logic devices. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.5987.

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

Garg, Deepak, and Michael C. Tschantz. From Indexed Lax Logic to Intuitionistic Logic. Fort Belvoir, VA: Defense Technical Information Center, January 2008. http://dx.doi.org/10.21236/ada476728.

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

Tailor, Sanjay. Fuzzy Logic. Fort Belvoir, VA: Defense Technical Information Center, May 1996. http://dx.doi.org/10.21236/ada310470.

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

Karri, Ramesh, Ozgur Sinanoglu, and Jeyavihayan Rajendran. Logic Encryption. Fort Belvoir, VA: Defense Technical Information Center, February 2014. http://dx.doi.org/10.21236/ada595228.

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

Obua, Steven. Abstraction Logic. Steven Obua (as Recursive Mind), October 2021. http://dx.doi.org/10.47757/abstraction.logic.1.

Full text
Abstract:
Abstraction Logic is introduced as a foundation for Practical Types and Practal. It combines the simplicity of first-order logic with direct support for variable binding constants called abstractions. It also allows free variables to depend on parameters, which means that first-order axiom schemata can be encoded as simple axioms. Conceptually abstraction logic is situated between first-order logic and second-order logic. It is sound and complete with respect to an intuitive and simple algebraic semantics.
APA, Harvard, Vancouver, ISO, and other styles
7

Jaspan, Ciera, Trisha Quan, and Jonathan Aldrich. Error Reporting Logic. Fort Belvoir, VA: Defense Technical Information Center, June 2008. http://dx.doi.org/10.21236/ada485458.

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

Carter, Nicholas P. Magnetoelectronic Reconfigurable Logic. Fort Belvoir, VA: Defense Technical Information Center, October 2005. http://dx.doi.org/10.21236/ada444869.

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

Giesecke, Normen. Ternary quantum logic. Portland State University Library, January 2000. http://dx.doi.org/10.15760/etd.5975.

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

Obua, Steven. Automating Abstraction Logic. Steven Obua (trading as Recursive Mind), March 2022. http://dx.doi.org/10.47757/aal.1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic '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