Relevant bibliographies by topics / Computer logic

Contents

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

Academic literature on the topic 'Computer logic'

Author: Grafiati
Published: 4 June 2021
Last updated: 21 February 2023

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 'Computer 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 "Computer logic"

1

Martin, Ursula. "Logic for computer science." Science of Computer Programming 11, no. 2 (December 1988): 176–78. http://dx.doi.org/10.1016/0167-6423(88)90006-8.

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

Devlin, Keith. "Logic for computer scientists." Science of Computer Programming 13, no. 2-3 (May 1990): 273–75. http://dx.doi.org/10.1016/0167-6423(90)90078-r.

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

Gadducci, Fabio, and Ugo Montanari. "Comparing logics for rewriting: rewriting logic, action calculi and tile logic." Theoretical Computer Science 285, no. 2 (August 2002): 319–58. http://dx.doi.org/10.1016/s0304-3975(01)00362-0.

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

HUET, GÉRARD. "Special issue on ‘Logical frameworks and metalanguages’." Journal of Functional Programming 13, no. 2 (March 2003): 257–60. http://dx.doi.org/10.1017/s0956796802004549.

Full text
Abstract:
There is both a great unity and a great diversity in presentations of logic. The diversity is staggering indeed – propositional logic, first-order logic, higher-order logic belong to one classification; linear logic, intuitionistic logic, classical logic, modal and temporal logics belong to another one. Logical deduction may be presented as a Hilbert style of combinators, as a natural deduction system, as sequent calculus, as proof nets of one variety or other, etc. Logic, originally a field of philosophy, turned into algebra with Boole, and more generally into meta-mathematics with Frege and Heyting. Professional logicians such as Gödel and later Tarski studied mathematical models, consistency and completeness, computability and complexity issues, set theory and foundations, etc. Logic became a very technical area of mathematical research in the last half century, with fine-grained analysis of expressiveness of subtheories of arithmetic or set theory, detailed analysis of well-foundedness through ordinal notations, logical complexity, etc. Meanwhile, computer modelling developed a need for concrete uses of logic, first for the design of computer circuits, then more widely for increasing the reliability of sofware through the use of formal specifications and proofs of correctness of computer programs. This gave rise to more exotic logics, such as dynamic logic, Hoare-style logic of axiomatic semantics, logics of partial values (such as Scott's denotational semantics and Plotkin's domain theory) or of partial terms (such as Feferman's free logic), etc. The first actual attempts at mechanisation of logical reasoning through the resolution principle (automated theorem proving) had been disappointing, but their shortcomings gave rise to a considerable body of research, developing detailed knowledge about equational reasoning through canonical simplification (rewriting theory) and proofs by induction (following Boyer and Moore successful integration of primitive recursive arithmetic within the LISP programming language). The special case of Horn clauses gave rise to a new paradigm of non-deterministic programming, called Logic Programming, developing later into Constraint Programming, blurring further the scope of logic. In order to study knowledge acquisition, researchers in artificial intelligence and computational linguistics studied exotic versions of modal logics such as Montague intentional logic, epistemic logic, dynamic logic or hybrid logic. Some others tried to capture common sense, and modeled the revision of beliefs with so-called non-monotonic logics. For the careful crafstmen of mathematical logic, this was the final outrage, and Girard gave his anathema to such “montres à moutardes”.
APA, Harvard, Vancouver, ISO, and other styles
5

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
6

Van Den Hoven, Jeroen, and Gert‐Jan Lokhorst. "Deontic Logic and Computer‐Supported Computer Ethics." Metaphilosophy 33, no. 3 (April 2002): 376–86. http://dx.doi.org/10.1111/1467-9973.00233.

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

Kuznetsov, Stepan. "Action Logic is Undecidable." ACM Transactions on Computational Logic 22, no. 2 (May 15, 2021): 1–26. http://dx.doi.org/10.1145/3445810.

Full text
Abstract:
Action logic is the algebraic logic (inequational theory) of residuated Kleene lattices. One of the operations of this logic is the Kleene star, which is axiomatized by an induction scheme. For a stronger system that uses an -rule instead (infinitary action logic), Buszkowski and Palka (2007) proved -completeness (thus, undecidability). Decidability of action logic itself was an open question, raised by Kozen in 1994. In this article, we show that it is undecidable, more precisely, -complete. We also prove the same undecidability results for all recursively enumerable logics between action logic and infinitary action logic, for fragments of these logics with only one of the two lattice (additive) connectives, and for action logic extended with the law of distributivity.
APA, Harvard, Vancouver, ISO, and other styles
8

Kamide, Norihiro. "Inconsistency-Tolerant Multi-Agent Calculus." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 22, no. 06 (December 2014): 815–29. http://dx.doi.org/10.1142/s0218488514500433.

Full text
Abstract:
Verifying and specifying multi-agent systems in an appropriate inconsistency-tolerant logic are of growing importance in Computer Science since computer systems are generally used by or composed of inconsistency-tolerant multi-agents. In this paper, an inconsistency-tolerant logic for representing multi-agents is introduced as a Gentzen-type sequent calculus. This logic (or calculus) has multiple negation connectives that correspond to each agent, and these negation connectives have the property of paraconsistency that guarantees inconsistency-tolerance. The logic proposed is regarded as a modified generalization of trilattice logics, which are known to be useful for expressing fine-grained truth-values in computer networks. The completeness, cut-elimination and decidability theorems for the proposed logic (or sequent calculus) are proved as the main results of this paper.
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Hai Yan. "Coding and Decoding Device Design of Three-Value Quantum Computer." Applied Mechanics and Materials 713-715 (January 2015): 1015–18. http://dx.doi.org/10.4028/www.scientific.net/amm.713-715.1015.

Full text
Abstract:
A quantum computer is the computer technology and the micro physical scientists will combine the technology achievements. Quantum computer is the processing of information by using the quantum properties of particle, a new concept quantum laws to control information transmission and processing of computer. Light has the advantages in space time parallel and high-frequency radiation, which makes the optical become the main target of research model the future of computers. This did not prevent the three valued logic calculus is still an important part of the three values of optical computer. It is precisely because the three value of optical code decoder and the three value, importance, ALU logic optical so, in three valued optical computer all the key parts, we firstly research the value of three logic optical light coding, decoder and a value of three.
APA, Harvard, Vancouver, ISO, and other styles
10

Steingartner, William, Andrea Polakova, Peter Praznak, and Valerie Novitzka. "Linear logic in computer science." Journal of Applied Mathematics and Computational Mechanics 14, no. 1 (March 2015): 91–100. http://dx.doi.org/10.17512/jamcm.2015.1.09.

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

Dissertations / Theses on the topic "Computer logic"

1

Tarnoff, David. "Episode 4.03 – Combinational Logic." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/31.

Full text
Abstract:
Individual logic gates are not very practical. Their power comes when you combine them to create combinational logic. This episode takes a look at combinational logic by working through an example in order to generate its truth table.
APA, Harvard, Vancouver, ISO, and other styles
2

Tarnoff, David. "Episode 5.02 – NAND Logic." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/39.

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

Tarnoff, David. "Episode 4.01 – Intro to Logic Gates." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/29.

Full text
Abstract:
Logic gates are the fundamental building blocks of digital circuits. In this episode, we take a look at the four most basic gates: AND, OR, exclusive-OR, and the inverter, and show how an XOR gate can be used to compare two digital values. Click here to read the show transcript.
APA, Harvard, Vancouver, ISO, and other styles
4

Giesecke, Normen. "Ternary quantum logic." PDXScholar, 2006. https://pdxscholar.library.pdx.edu/open_access_etds/4092.

Full text
Abstract:
The application of Moore's Law would not be feasible by using the computing systems fabrication principles that are prevalent today. Fundamental changes in the field of computing are needed to keep Moore's Law operational. Different quantum technologies are available to take the advancement of computing into the future. Logic in quantum technology uses gates that are very different from those used in contemporary technology. Limiting itself to reversible operations, this thesis presents different methods to realize these logic gates. Two methods using Generalized Ternary Gates and Muthukrishnan Stroud Gates are presented for synthesis of ternary logic gates. Realizations of well-known quantum gates like the Feynman gate, Toffoli Gate, 2-qudit and 3-qudit SW AP gates are shown. In addition a new gate, the Inverse SW AP gate, is proposed and its realization is also presented.
APA, Harvard, Vancouver, ISO, and other styles
5

Tarnoff, David. "Episode 4.04 – NAND, NOR, and Exclusive-NOR Logic." Digital Commons @ East Tennessee State University, 2020. https://dc.etsu.edu/computer-organization-design-oer/32.

Full text
Abstract:
The simplest combinational logic circuits are made by inverting the output of a fundamental logic gate. Despite this simplicity, these gates are vital. In fact, we can realize any truth table using a circuit made only from AND gates with inverted outputs.
APA, Harvard, Vancouver, ISO, and other styles
6

Wilkinson, Toby. "Enriched coalgebraic modal logic." Thesis, University of Southampton, 2013. https://eprints.soton.ac.uk/354112/.

Full text
Abstract:
We formalise the notion of enriched coalgebraic modal logic, and determine conditions on the category V (over which we enrich), that allow an enriched logical connection to be extended to a framework for enriched coalgebraic modal logic. Our framework uses V-functors L: A → A and T: X → X, where L determines the modalities of the resulting modal logics, and T determines the coalgebras that provide the semantics. We introduce the V-category Mod(A, α) of models for an L-algebra (A, α), and show that the forgetful V-functor from Mod(A, α) to X creates conical colimits. The concepts of bisimulation, simulation, and behavioural metrics (behavioural approximations),are generalised to a notion of behavioural questions that can be asked of pairs of states in a model. These behavioural questions are shown to arise through choosing the category V to be constructed through enrichment over a commutative unital quantale (Q, Ⓧ, I) in the style of Lawvere (1973). Corresponding generalisations of logical equivalence and expressivity are also introduced,and expressivity of an L-algebra (A, α) is shown to have an abstract category theoretic characterisation in terms of the existence of a so-called behavioural skeleton in the category Mod(A, α). In the resulting framework every model carries the means to compare the behaviour of its states, and we argue that this implies a class of systems is not fully defined until it is specified how states are to be compared or related.
APA, Harvard, Vancouver, ISO, and other styles
7

Fidjeland, Andreas Kirkeby. "Custom computer architectures for logic programming." Thesis, Imperial College London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.439777.

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

Luongo, Kevin. "Nanoparticle-Based Spintronic Computer Logic Switch." FIU Digital Commons, 2019. https://digitalcommons.fiu.edu/etd/3962.

Full text
Abstract:
Spintronics is a rapidly growing research field due to scalability, integrablility within existing VLSI architecture, significantly reduced switching energy and latency while maintaining stable bit orientation (Spin-up, Spin-down). For the first time sub-5nm Spin Transfer Torque –Magnetic Tunneling Junctions (STT-MTJ) were investigated utilizing various Integrated Circuit (IC) fabrication techniques to evaluate novel concepts in logic switches. Tunneling Magnetoresistance (TMR) was measured in STT-MTJ stacks of Ta/CoFeB/MgO/CoFeB/Ta with differing diameter ferrimagnetic CoFe2O4 nanoparticles (10nm, 4nm and 2nm) embedded in the MgO layer. MR was detected in the 2nm and 4nm particle devices and demonstrated evidence of single electron transport. Tri-layer STT-MTJ devices were fabricated using a thin film stack of Ta/Ru/Ta/CoFeB(M1)/MgO/CoFeB(M2)/MgO/CoFeB(M3)/Ta. The overall diameter of the stack was reduced to sub-20nm using Focused Ion Beam (FIB) to mill away extra material. The coercivities of the ferrimagnetic CoFeB layers were modified during thin film deposition by altering sputter conditions. Field Applied- Magnetic Force Microscopy (FA-MFM) was used to detect four different magnetic intensities corresponding to three discreet resistances in the singly addressed device, making this architecture a candidate for neuromorphic computational applications. Lastly a lithographic-less architecture was developed to mass fabricate and electo-mechanically probe multi-layered, single point, sub-5nm particle based STT-MTJ devices using off-the-shelf anodized nanoporous alumina. Once fabricated, the devices were probed to measure their IV characteristics and magnetoresistance (MR). The unprecedented MR changes on the order of 50,000% at room temperature suggest quantum mechanical behavior.
APA, Harvard, Vancouver, ISO, and other styles
9

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
10

Kabiri, Chimeh Mozhgan. "Data structures for SIMD logic simulation." Thesis, University of Glasgow, 2016. http://theses.gla.ac.uk/7521/.

Full text
Abstract:
Due to the growth of design size and complexity, design verification is an important aspect of the Logic Circuit development process. The purpose of verification is to validate that the design meets the system requirements and specification. This is done by either functional or formal verification. The most popular approach to functional verification is the use of simulation based techniques. Using models to replicate the behaviour of an actual system is called simulation. In this thesis, a software/data structure architecture without explicit locks is proposed to accelerate logic gate circuit simulation. We call thus system ZSIM. The ZSIM software architecture simulator targets low cost SIMD multi-core machines. Its performance is evaluated on the Intel Xeon Phi and 2 other machines (Intel Xeon and AMD Opteron). The aim of these experiments is to: • Verify that the data structure used allows SIMD acceleration, particularly on machines with gather instructions ( section 5.3.1). • Verify that, on sufficiently large circuits, substantial gains could be made from multicore parallelism ( section 5.3.2 ). • Show that a simulator using this approach out-performs an existing commercial simulator on a standard workstation ( section 5.3.3 ). • Show that the performance on a cheap Xeon Phi card is competitive with results reported elsewhere on much more expensive super-computers ( section 5.3.5 ). To evaluate the ZSIM, two types of test circuits were used: 1. Circuits from the IWLS benchmark suit [1] which allow direct comparison with other published studies of parallel simulators.2. Circuits generated by a parametrised circuit synthesizer. The synthesizer used an algorithm that has been shown to generate circuits that are statistically representative of real logic circuits. The synthesizer allowed testing of a range of very large circuits, larger than the ones for which it was possible to obtain open source files. The experimental results show that with SIMD acceleration and multicore, ZSIM gained a peak parallelisation factor of 300 on Intel Xeon Phi and 11 on Intel Xeon. With only SIMD enabled, ZSIM achieved a maximum parallelistion gain of 10 on Intel Xeon Phi and 4 on Intel Xeon. Furthermore, it was shown that this software architecture simulator running on a SIMD machine is much faster than, and can handle much bigger circuits than a widely used commercial simulator (Xilinx) running on a workstation. The performance achieved by ZSIM was also compared with similar pre-existing work on logic simulation targeting GPUs and supercomputers. It was shown that ZSIM simulator running on a Xeon Phi machine gives comparable simulation performance to the IBM Blue Gene supercomputer at very much lower cost. The experimental results have shown that the Xeon Phi is competitive with simulation on GPUs and allows the handling of much larger circuits than have been reported for GPU simulation. When targeting Xeon Phi architecture, the automatic cache management of the Xeon Phi, handles and manages the on-chip local store without any explicit mention of the local store being made in the architecture of the simulator itself. However, targeting GPUs, explicit cache management in program increases the complexity of the software architecture. Furthermore, one of the strongest points of the ZSIM simulator is its portability. Note that the same code was tested on both AMD and Xeon Phi machines. The same architecture that efficiently performs on Xeon Phi, was ported into a 64 core NUMA AMD Opteron. To conclude, the two main achievements are restated as following: The primary achievement of this work was proving that the ZSIM architecture was faster than previously published logic simulators on low cost platforms. The secondary achievement was the development of a synthetic testing suite that went beyond the scale range that was previously publicly available, based on prior work that showed the synthesis technique is valid.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Computer logic"

1

Hsu, John Y. Computer Logic. New York, NY: Springer New York, 2002. http://dx.doi.org/10.1007/978-1-4613-0047-2.

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

Workshop on Computer Science Logic (17th 2003 Vienna, Austria). Computer science logic. Berlin: Springer, 2003.

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

Duparc, Jacques, and Thomas A. Henzinger, eds. Computer Science Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74915-8.

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

Flum, Jörg, and Mario Rodriguez-Artalejo, eds. Computer Science Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48168-0.

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

Gottlob, Georg, Etienne Grandjean, and Katrin Seyr, eds. Computer Science Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/10703163.

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

Bradfield, Julian, ed. Computer Science Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45793-3.

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

Fribourg, Laurent, ed. Computer Science Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44802-0.

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

Ong, Luke, ed. Computer Science Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11538363.

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

van Dalen, Dirk, and Marc Bezem, eds. Computer Science Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63172-0.

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

Nielsen, Mogens, and Wolfgang Thomas, eds. Computer Science Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0028003.

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

Book chapters on the topic "Computer logic"

1

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
2

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
3

Elahi, Ata. "Combinational Logic." In Computer Systems, 71–95. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66775-1_4.

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

Elahi, Ata. "Combinational Logic." In Computer Systems, 75–101. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-93449-1_4.

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

Dawe, M. S., and C. M. Dawe. "Logic." In PROLOG for Computer Science, 7–20. London: Springer London, 1994. http://dx.doi.org/10.1007/978-1-4471-2031-5_2.

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

Vince, John. "Logic." In Foundation Mathematics for Computer Science, 57–79. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21437-5_4.

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

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

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

Vince, John. "Logic." In Foundation Mathematics for Computer Science, 55–78. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-42078-9_4.

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

Fortney, Jon Pierre. "Logic." In Discrete Mathematics for Computer Science, 43–60. First edition. | Boca Raton : C&H/CRC Press, 2021.: Chapman and Hall/CRC, 2020. http://dx.doi.org/10.1201/9781003091479-3.

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

Erciyes, K. "Logic." In Undergraduate Topics in Computer Science, 3–22. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61115-6_1.

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

Conference papers on the topic "Computer logic"

1

Lunyao, Wang, and Xia Yinshui. "Logic Minimization Based on Dual Logic." In 2013 International Conference on Computer-Aided Design and Computer Graphics (CAD/Graphics). IEEE, 2013. http://dx.doi.org/10.1109/cadgraphics.2013.23.

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

Lonsky, I. I., S. V. Bulgakov, and V. Ya Tsvetkov. "Probabilistic logic in computer science." In PROCEEDINGS OF THE III INTERNATIONAL CONFERENCE ON ADVANCED TECHNOLOGIES IN MATERIALS SCIENCE, MECHANICAL AND AUTOMATION ENGINEERING: MIP: Engineering-III – 2021. AIP Publishing, 2021. http://dx.doi.org/10.1063/5.0071597.

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

Roda, Valentin O. "Session 3 - computer arithmetic." In 2010 VI Southern Programmable Logic Conference (SPL). IEEE, 2010. http://dx.doi.org/10.1109/spl.2010.5482997.

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

Gaillardon, Pierre-Emmanuel, Luca Amarú, Anne Siemon, Eike Linn, Rainer Waser, Anupam Chattopadhyay, and Giovanni De Micheli. "TheProgrammable Logic-in-Memory(PLiM) Computer." In Proceedings of the 2016 Design, Automation & Test in Europe Conference & Exhibition (DATE). Singapore: Research Publishing Services, 2016. http://dx.doi.org/10.3850/9783981537079_0970.

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

Leal, Rosalie C., Kelvin Kris Gonzales, and Allan R. Leal. "Learning logic through computer-based games." In the 10th International Conference. New York, New York, USA: ACM Press, 2018. http://dx.doi.org/10.1145/3290511.3290559.

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

Rauwerdink, Jeffrey L. "Computer Guided Logic IC Fault Location." In 25th International Reliability Physics Symposium. IEEE, 1987. http://dx.doi.org/10.1109/irps.1987.362164.

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

Cofano, M., G. Santoro, M. Vacca, D. Pala, G. Causapruno, F. Cairo, F. Riente, et al. "Logic-in-Memory: A Nano Magnet Logic Implementation." In 2015 IEEE Computer Society Annual Symposium on VLSI (ISVLSI). IEEE, 2015. http://dx.doi.org/10.1109/isvlsi.2015.121.

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

Zadeh, Lotfi. "Fuzzy logic (abstract)." In the 22nd annual ACM computer science conference. New York, New York, USA: ACM Press, 1994. http://dx.doi.org/10.1145/197530.197667.

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

Gupta, Madan M. "Fuzzy Logic, Neural Networks And Computer Vision." In 1988 Robotics Conferences, edited by David P. Casasent. SPIE, 1989. http://dx.doi.org/10.1117/12.960296.

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

Posch, Irene, and Ebru Kurbak. "CRAFTED LOGIC Towards Hand-Crafting a Computer." In CHI'16: CHI Conference on Human Factors in Computing Systems. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2851581.2891101.

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

Reports on the topic "Computer logic"

1

IOWA STATE UNIV AMES DEPT OF MATHEMATICS. Applications of Algebraic Logic and Universal Algebra to Computer Science. Fort Belvoir, VA: Defense Technical Information Center, June 1989. http://dx.doi.org/10.21236/ada210556.

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

Onneweer, Siep, Hans Kerkhoff, and Jon Butler. Structural Computer-Aided Design of Current-Mode CMOS Logic Circuits. Fort Belvoir, VA: Defense Technical Information Center, January 1988. http://dx.doi.org/10.21236/ada608071.

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

Cheng, Julian. Integrated Photonic Switches and Logic Gate Arrays for Parallel Optical Switching and Computer Architectures. Fort Belvoir, VA: Defense Technical Information Center, June 1995. http://dx.doi.org/10.21236/ada297732.

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

Huang, Z., J. Shimeld, and M. Williamson. Application of computer neural network, and fuzzy set logic to petroleum geology, offshore eastern Canada. Natural Resources Canada/ESS/Scientific and Technical Publishing Services, 1994. http://dx.doi.org/10.4095/194121.

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

Lutz, Carsten. PDL with Intersection and Converse is Decidable. Technische Universität Dresden, 2005. http://dx.doi.org/10.25368/2022.148.

Full text
Abstract:
In its many guises and variations, propositional dynamic logic (PDL) plays an important role in various areas of computer science such as databases, artificial intelligence, and computer linguistics. One relevant and powerful variation is ICPDL, the extension of PDL with intersection and converse. Although ICPDL has several interesting applications, its computational properties have never been investigated. In this paper, we prove that ICPDL is decidable by developing a translation to the monadic second order logic of infinite trees. Our result has applications in information logic, description logic, and epistemic logic. In particular, we solve a long-standing open problem in information logic. Another virtue of our approach is that it provides a decidability proof that is more transparent than existing ones for PDL with intersection (but without converse).
APA, Harvard, Vancouver, ISO, and other styles
6

Walter, K. E. R-1 (C-620-A) and R-2 (C-620-B) air compressor control logic, computer software description. Revision 1. Office of Scientific and Technical Information (OSTI), June 1995. http://dx.doi.org/10.2172/90072.

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

Meseguer, J. Rewriting Logic and its Applications First International Workshop, Asilomar Conference Center, Pacific Grove, California, 3-6 September 1996. Volume 4 Electronic Notes in Theoretical Computer Science. Fort Belvoir, VA: Defense Technical Information Center, September 1996. http://dx.doi.org/10.21236/ada314817.

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

Baader, Franz, Stefan Borgwardt, and Barbara Morawska. Computing Minimal EL-Unifiers is Hard. Technische Universität Dresden, 2012. http://dx.doi.org/10.25368/2022.187.

Full text
Abstract:
Unification has been investigated both in modal logics and in description logics, albeit with different motivations. In description logics, unification can be used to detect redundancies in ontologies. In this context, it is not sufficient to decide unifiability, one must also compute appropriate unifiers and present them to the user. For the description logic EL, which is used to define several large biomedical ontologies, deciding unifiability is an NP-complete problem. It is known that every solvable EL-unification problem has a minimal unifier, and that every minimal unifier is a local unifier. Existing unification algorithms for EL compute all minimal unifiers, but additionally (all or some) non-minimal local unifiers. Computing only the minimal unifiers would be better since there are considerably less minimal unifiers than local ones, and their size is usually also quite small. In this paper we investigate the question whether the known algorithms for EL-unification can be modified such that they compute exactly the minimal unifiers without changing the complexity and the basic nature of the algorithms. Basically, the answer we give to this question is negative.
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
Abstract:
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, and other styles
10

Baader, Franz. A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.139.

Full text
Abstract:
In two previous papers we have investigates the problem of computing the least common subsumer (lcs) and the most specific concept (msc) for the description logic EL in the presence of terminological cycles that are interpreted with descriptive semantics, which is the usual first-order semantics for description logics. In this setting, neither the lcs nor the msc needs to exist. We were able to characterize the cases in which the lcs/msc exists, but it was not clear whether this characterization yields decidability of the existence problem. In the present paper, we develop a common graph-theoretic generalization of these characterizations, and show that the resulting property is indeed decidable, thus yielding decidability of the existence of the lcs and the msc. This is achieved by expressing the property in monadic second-order logic on infinite trees. We also show that, if it exists, then the lcs/msc can be computed in polynomial time.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Computer 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