Relevant bibliographies by topics / Logic in Computer Science

Contents

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

Academic literature on the topic 'Logic in Computer Science'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 June 2024

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Logic in Computer Science.'

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 in Computer Science"

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

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
3

Iashin, Boris Leonidovich. "Non-Classical Logics in Modern Science." Философская мысль, no. 1 (January 2023): 15–25. http://dx.doi.org/10.25136/2409-8728.2023.1.39350.

Full text
Abstract:
Non-classical logicians have significantly expanded the traditional field of using logical methods. The first of them was the three-digit logic of Y. Lukasevich. Next came the three-digit logic of A. Bochvar, the "quantum logics" of G. Reichenbach and P. Detush-Fevrier, infinite-valued, probabilistic and other logics. The possibilities of non-classical logics have become widely used in various branches of scientific knowledge. Polysemantic, fuzzy, intuitionistic, modal, relevant and paranoherent, temporal and other non-classical logics are widely used today in physics, computational mathematics, computer science, linguistics, jurisprudence, ethics and other fields of natural science and socio-humanitarian knowledge. The recently increased interest in non-classical logics is explained, first of all, by the fact that various philosophical, syntactic, semantic and metalogical problems that were previously discussed in the scientific community are being replaced by practical interests. The main source of such interest is their wide application in computer science, artificial intelligence and programming. The logic of causality is used in the interpretation of the concepts of "law of nature", "ontological necessity" and "determinism"; temporal modal logics - for modeling, specification and verification of software systems of logical control; logics with vector semantics, combining the features of fuzzy and para-contradictory logics - in solving problems of dynamic verification of production knowledge bases and expert systems.
APA, Harvard, Vancouver, ISO, and other styles
4

Rota, Gian-Carlo. "Mathematical logic and theoretical computer science." Advances in Mathematics 72, no. 1 (November 1988): 168. http://dx.doi.org/10.1016/0001-8708(88)90023-0.

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

Bringsjord, Selmer. "Computer Science as Immaterial Formal Logic." Philosophy & Technology 33, no. 2 (August 5, 2019): 339–47. http://dx.doi.org/10.1007/s13347-019-00366-7.

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

Hoogewijs, Albert. "Partial-predicate logic in computer science." Acta Informatica 24, no. 4 (August 1987): 381–93. http://dx.doi.org/10.1007/bf00292109.

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

Blass, Andreas. "Symbioses between mathematical logic and computer science." Annals of Pure and Applied Logic 167, no. 10 (October 2016): 868–78. http://dx.doi.org/10.1016/j.apal.2014.04.018.

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

DeMol, Liesbeth. "Logic, Programming, and Computer Science: Local Perspectives." IEEE Annals of the History of Computing 43, no. 4 (October 1, 2021): 5–9. http://dx.doi.org/10.1109/mahc.2021.3121578.

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

Vardi, Moshe Y. "Special selection in logic in computer science." Journal of Symbolic Logic 62, no. 2 (June 1997): 608. http://dx.doi.org/10.2307/2275549.

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

Hamburger, Henry, and Dana Richards. "Logic and language models for computer science." ACM SIGACT News 33, no. 1 (March 2002): 67–70. http://dx.doi.org/10.1145/507457.507471.

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

Dissertations / Theses on the topic "Logic in Computer Science"

1

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
2

Coughlin, Devin. "Type-Intertwined Separation Logic." Thesis, University of Colorado at Boulder, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=3704668.

Full text
Abstract:

Static program analysis can improve programmer productivity and software reliability by definitively ruling out entire classes of programmer mistakes. For mainstream imperative languages such as C, C++, and Java, static analysis about the heap---memory that is dynamically allocated at run time---is particularly challenging because heap memory acts as global, mutable state. This dissertation describes how to soundly combine two static analyses that each take vastly different approaches to reasoning about the heap: type systems and separation logic. Traditional type systems take an alias-agnostic, global view of the heap that affords both fast verification and light-weight annotation of invariants holding over the entire program. Separation logic, in contrast, provides an alias-aware, local view of the heap in which invariants can vary at each program point. In this work, I show how type systems and separation logic can be safely and efficiently combined. The result is type-intertwined separation logic, an analysis that applies traditional type-based reasoning to some regions of the program and separation logic to others---converting between analysis representations at region boundaries---and summarizes some portions of the heap with coarse type invariants and others with precise separation logic invariants. The key challenge that this dissertation addresses is the communication and preservation of heap invariants between analyses. I tackle this challenge with two core contributions. The first is type-consistent summarization and materialization, which enables type-intertwined separation logic to both leverage and selectively violate the global type invariant. This mechanism allows the analysis to efficiently and precisely verify invariants that hold almost everywhere. Second, I describe gated separating conjunction, a non-commutative strengthening of standard separating conjunction that expresses local dis-pointing relationships between sub-heaps. Gated separation enables local heap reasoning by permitting the separation logic to frame out portions of memory and prevent the type system from interfering with its contents---an operation that would be unsound in type-intertwined analysis with only standard separating conjunction. With these two contributions, type-intertwined separation logic combines the benefits of both type-like global reasoning and separation-logic-style local reasoning in a single analysis.

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

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
4

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
5

Xu, Qing. "Optimization techniques for distributed logic simulation." Thesis, McGill University, 2011. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=96665.

Full text
Abstract:
Gate level simulation is a necessary step to verify the correctness of a circuitdesign before fabrication. It is a very time-consuming application, especially in lightof current circuit sizes. Since circuits are continually growing in size and complexity,there is a need for more efficient simulation techniques to keep the circuit verificationtime acceptably small. The use of parallel or distributed simulation is such a technique.When executed on a network of workstations, distributed simulation is alsoa very cost-effective technique. This research focuses on optimization techniques forTime Warp based gate-level logic simulations. The techniques which are described inthis thesis are oriented towards distributed platforms. The first major contributionof this thesis was the creation of an object oriented distributed simulator, XTW. Ituses an optimistic synchronization algorithm and incorporates a number of knownoptimization techniques targeting different aspects of distributed logic simulation.XEQ, an O(1) event scheduling algorithm for this simulator was developed for usein XTW. XEQ enabled us to execute gate level simulations up to 9.4 times fasterthan the same simulator using a skip-list (O(lg n)) event queue. rb-messagea mechanism which reduces the cost of rollback in Time Warp was also developedfor use in XTW. Our experiments revealed that the rb-message mechanism reducedthe number of anti-messages sent in a Time Warp based logic simulation by 76%on average. Moreover, based on the observations that (1)not all circuits should besimulated in parallel and (2) different circuits achieve their best parallel simulationperformance with a different number of compute nodes, an algorithm that uses theK-NN machine learning algorithm was devised to determine the most effective softwareand hardware combination for a logic simulation. After an extensive trainingregime, it was shown to make a correct prediction 99% of the time on whether touse a parallel or sequential simulator. The predicted number of nodes to use on aparallel platform was shown to produce an average execution time which was notmore than 12% of the smallest execution time. The configuration which resulted inthe minimal execution time was picked 61% of the time. A final contribution of thisthesis is an effort to link together commercial single processor simulators making useof Verilog PLI.
La simulation "gate-level" est une tape ncessaire pour vrifier la conformit dela conception d'un circuit avant sa fabrication. C'est un programme qui prendbeaucoup de temps, compte tenu particulirement de la taille actuelle des circuits.Ceux-ci ne cessant de se dvelopper en taille et en complexit, il y a un rel besoin detechniques de simulation plus efficaces afin de maintenir la dure de vrification ducircuit raisonnablement courte. Une de ces techniques consiste utiliser la simulationparallle ou distribue. Quand excute sur un rseau de postes de travail, la simulationdistribue se rvle galement tre une technique trs rentable. Cette recherche se concentresur l'optimisation des techniques de simulations "gate-level" logiques bases surTime Warp. Les techniques qui sont dcrites dans cet expos sont orientes vers lesplateformes distribues. La premire contribution majeure de cet expos a t la crationd'un simulateur distribu orient sur l'objet, XTW. Il utilise un algorithme de synchronisationoptimiste et incorpore un certain nombre de techniques d'optimisationconnues visant diffrents aspects de la simulation distribue logique. XEQ, un algorithmeprogrammateur d'vnements O(1) pour ce simulateur a t dvelopp pour treutilis dans XTW. XEQ nous permet d'excuter des simulations "gate-level" jusqu'9,4 fois plus rapides qu'avec le mme simulateur utilisant une suite d'vnement en"skip-list" (O(lg n)). "rb-message" – un mcanisme qui diminue le co?t de rductiondans Time Warp a galement t mis au point pour tre utilis dans XTW. Nos essaisont rvl que le mcanisme de "rb-message" permettait de diminuer le nombre des antimessagesenvoys au cours d'une simulation logique base sur Time Warp de 76 % enmoyenne. Il a t en outre con?u, en se basant sur les observations que (1) certainscircuits ne devraient pas tre simuls en parallle et (2) que diffrents circuits atteignentleur meilleure performance de simulation parallle avec un nombre diffrent de noeudsde calculs, un algorithme utilisant l'algorithme d'apprentissage de la machine K-NNafin de dterminer quelle tait l'association de logiciel et de matriel la plus efficacedans le cadre d'une simulation logique. l'issue d'un entra?nement approfondi, ilest apparu qu'il pouvait faire un pronostic juste 99 % tablissant quand utiliser unsimulateur parallle ou squentiel. Le nombre annonc de noeuds utiliser sur une plateformeparallle s'est avr permettre une dure d'excution moyenne gale 12 % de la pluscourte dure d'excution. La configuration ayant abouti la dure d'excution minimalea t reprise dans 61 % des cas. Dernire contribution apporte par cet expos, relier lessimulateurs commerciaux processeur unique utilisant Verilog PLI.
APA, Harvard, Vancouver, ISO, and other styles
6

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
7

Lapointe, Stéphane. "Induction of recursive logic programs." Thesis, University of Ottawa (Canada), 1992. http://hdl.handle.net/10393/7467.

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

Botha, Leonard. "DevelopinThe Bayesian Description Logic BALC." Master's thesis, University of Cape Town, 2018. http://hdl.handle.net/11427/29350.

Full text
Abstract:
Description Logics (DLs) that support uncertainty are not as well studied as their crisp alternatives. This limits their application in many real world domains, which often require reasoning about uncertain or contradictory information. In this thesis we present the Bayesian Description Logic BALC, which takes existing work on Bayesian Description Logics and applies it to the classical Description Logic ALC. We define five reasoning problems for BALC; two versions of concept satisfiability (called total and partial respectively), knowledge base consistency, three subsumption problems (positive subsumption, p-subsumption, exact subsumption), instance checking, and the most likely context problem. Consistency, satisfiability, and instance checking have not previously been studied in the context of contextual Bayesian DLs and as such this is new work. We then go on to provide algorithms that solve all of these reasoning problems, with the exception of the most likely context problem. We found that all reasoning problems in BALC are in the same complexity class as their classical variants, provided that the size of the Bayesian Network is included in the size of the knowledge base. That is, all reasoning problems mentioned above (excluding most likely context) are exponential in the size of the knowledge base and the size of the Bayesian Network.
APA, Harvard, Vancouver, ISO, and other styles
9

Xu, Qing. "XTW, a parallel and distributed logic simulator." Thesis, McGill University, 2003. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=19631.

Full text
Abstract:
In this thesis, a new parallel synchronization mechanism, XTW, is proposed. XTW is designed for the parallel simulation of large logic circuits on a cluster of computer workstations. In XTW, a new event queue structure, XEQ, is created in order to reduce the cost of event-scheduling; a new message "un-sending" mechanism, "rb-messages", is proposed to reduce the cost of un-sending" previously sent messages. Both theoretical analysis and actual simulations provide evidence that XTW speeds up parallel logic simulations and provides excellent scalability versus the number of processors and the circuit size. An object-oriented parallel logic simulation software framework, XTWFM, is built upon the base of the XTW mechanism. A milliongates circuit, which can not be simulated by our sequential simulator, is successfully simulated by XTWFM over a cluster of 6 "small" PCs. This success demonstrates that a cluster of PCs is an attractive low-cost alternative for large scale circuit simulation.
APA, Harvard, Vancouver, ISO, and other styles
10

Phillips, Caitlin. "An algebraic approach to dynamic epistemic logic." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=86767.

Full text
Abstract:
In reasoning about multi-agent systems, it is important to look beyond the realm of propositional logic and to reason about the knowledge of agents within the system, as what they know about the environment will affect how they behave. A useful tool for formalizing and analyzing what agents know is epistemic logic, a modal logic developed by philosophers in the early 1960s. Epistemic logic is key to understanding knowledge in multi-agent systems, but insufficient if one wishes to study how the agents' knowledge changes over time. To do this, it is necessary to use a logic that combines dynamic and epistemic modalities, called dynamic epistemic logic. Some formalizations of dynamic epistemic logic use Kripke semantics for the states and actions, while others take a more algebraic approach, and use order-theoretic structures in their semantics. We discuss several of these logics, but focus predominantly on the algebraic framework for dynamic epistemic logic.
Past approaches to dynamic epistemic logic have typically been focused on actions whose primary purpose is to communicate information from one agent to another. These actions are unable to alter the valuation of any proposition within the system. In fields such as security and economics, it is easy to imagine situations in which this sort of action would be insufficient. Instead, we expand the framework to include both communication actions and actions that change the state of the system. Furthermore, we propose a new modality which captures both epistemic and propositional changes that result from the agents' actions.
En raisonnement sur les systemes multi-agents, il est important de regarder au-dela du domaine de la logique propositionnelle et de raisonner sur les con- naissances des agents au sein du syst`eme, parce que ce qu'ils savent au sujet de l'environnement influe sur la mani`ere dont ils se comportent. Un outil utile pour l'analyse et la formalisation de ce que les agents savent, est la logique epistemique, une logique modale developpee par les philosophes du debut des annees 1960. La logique epistemique est la cle de la comprehension des connaissances dans les systemes multi-agents, mais elle est insuffisante si l'on veut etudier la facon dont la connaissance des agents evolue a travers le temps. Pour ce faire, il est necessaire de recourir a une logique qui allie des modalites dynamiques et epistemiques, appele la logique epistemique dynamique. Certaines formalisations de la logique epistemique dynamique utilisent la semantique de Kripke pour les etats et les actions, tandis que d'autres prennent une approche algebrique, et utilisent les structures ordonne dans leur semantique. Nous discutons plusieurs de ces logiques, mais nous nous concentrons principalement sur le cadre algebrique pour la logique epistemique dynamique.
Les approches adoptees dans le passe a la logique epistemique dynamique ont generalement ete axe sur les actions dont l'objectif principal est de communiquer des informations d'un agent a un autre. Ces actions sont dans l'impossibilite de modifier l' evaluation de toute proposition au sein du systeme. Dans des domaines tels que la securite et l' economie, il est facile d'imaginer des situations dans lesquelles ce type d'action serait insuffisante. Au lieu de cela, nous etendons le cadre algebrique pour inclure a la fois des actions de communication et des actions qui changent l' etat du systeme. En outre, nous proposons une nouvelle modalite qui permet de capturer a la fois les changements epistemiques et les changements propositionels qui resultent de l'action des agents.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Logic in Computer Science"

1

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
2

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
3

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
4

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
5

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
6

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
7

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
8

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
9

Börger, Egon, Yuri Gurevich, and Karl Meinke, eds. Computer Science Logic. Berlin/Heidelberg: Springer-Verlag, 1994. http://dx.doi.org/10.1007/bfb0049319.

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

Pacholski, Leszek, and Jerzy Tiuryn, eds. Computer Science Logic. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/bfb0022242.

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

Book chapters on the topic "Logic in Computer Science"

1

Henglein, Fritz. "Rock’n’Roll Computer Science." In Logic and Program Semantics, 354–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29485-3_33.

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

Belohlavek, Radim, Rudolf Kruse, and Christian Moewes. "Fuzzy Logic in Computer Science." In Computer Science, 385–419. New York, NY: Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1168-0_16.

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

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
4

Lim, Daniel. "Logic." In Philosophy through Computer Science, 30–44. New York: Routledge, 2023. http://dx.doi.org/10.4324/9781003271284-4.

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

Della Rocca, Simona Ronchi, and Luca Roversi. "Intersection Logic." In Computer Science Logic, 414–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44802-0_29.

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

Andreoli, Jean-Marc, Gabriele Pulcini, and Paul Ruet. "Permutative Logic." In Computer Science Logic, 184–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11538363_14.

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

Finkbeiner, Bernd, and Sven Schewe. "Coordination Logic." In Computer Science Logic, 305–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15205-4_25.

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

Gillies, Donald. "Logicism and the Development of Computer Science." In Computational Logic: Logic Programming and Beyond, 588–604. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45632-5_23.

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

Feferman, Solomon. "Tarski’s Influence on Computer Science." In Studies in Universal Logic, 391–404. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-65430-0_29.

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

Vickers, Steve. "Geometric Logic in Computer Science." In Theory and Formal Methods 1993, 37–54. London: Springer London, 1993. http://dx.doi.org/10.1007/978-1-4471-3503-6_4.

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

Conference papers on the topic "Logic in Computer Science"

1

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
2

Gehrke, Mai. "Duality in Computer Science." In LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2016. http://dx.doi.org/10.1145/2933575.2934575.

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

Schreiner, Wolfgang. "Logic and Semantic Technologies for Computer Science Education." In 2019 IEEE 15th International Scientific Conference on Informatics. IEEE, 2019. http://dx.doi.org/10.1109/informatics47936.2019.9119285.

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

Myers, J. Paul. "The central role of mathematical logic in computer science." In the twenty-first SIGCSE technical symposium. New York, New York, USA: ACM Press, 1990. http://dx.doi.org/10.1145/323410.319071.

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

"Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)." In Proceedings. 14th Symposium on Logic in Computer Science. IEEE, 1999. http://dx.doi.org/10.1109/lics.1999.782575.

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

"Proceedings 16th Annual IEEE Symposium on Logic in Computer Science." In Proceedings 16th Annual IEEE Symposium on Logic in Computer Science. IEEE, 2001. http://dx.doi.org/10.1109/lics.2001.932476.

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

"Proceedings 17th Annual IEEE Symposium on Logic in Computer Science." In Proceedings 17th Annual IEEE Symposium on Logic in Computer Science. IEEE, 2002. http://dx.doi.org/10.1109/lics.2002.1029811.

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

"Proceedings 18th Annual IEEE Symposium on Logic in Computer Science." In Proceedings 18th Annual IEEE Symposium on Logic in Computer Science. IEEE, 2003. http://dx.doi.org/10.1109/lics.2003.1210038.

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

"Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science." In Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science. IEEE, 1994. http://dx.doi.org/10.1109/lics.1994.316093.

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

"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science." In Proceedings 11th Annual IEEE Symposium on Logic in Computer Science. IEEE, 1996. http://dx.doi.org/10.1109/lics.1996.561297.

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

Reports on the topic "Logic in Computer Science"

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

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
3

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
4

Striuk, Andrii M. Software engineering: first 50 years of formation and development. [б. в.], December 2018. http://dx.doi.org/10.31812/123456789/2880.

Full text
Abstract:
The article analyzes the main stages of software engineering (SE) development. Based on the analysis of materials from the first SE conferences (1968-1969), it was determined how the software crisis prompted scientists and practitioners to join forces to form an engineering approach to programming. Differences in professional training for SE are identified. The fundamental components of the training of future software engineers are highlighted. The evolution of approaches to the design, implementation, testing and documentation of software is considered. The system scientific, technological approaches and methods for the design and construction of computer programs are highlighted. Analysis of the historical stages of the development of SE showed that despite the universal recognition of the importance of using the mathematical apparatus of logic, automata theory and linguistics when developing software, it was created empirically without its use. The factor that led practitioners to turn to the mathematical foundations of an SE is the increasing complexity of software and the inability of empirical approaches to its development and management to cope with it. The training of software engineers highlighted the problem of the rapid obsolescence of the technological content of education, the solution of which lies in its fundamentalization through the identification of the basic foundations of the industry. It is determined that mastering the basics of computer science is the foundation of vocational training in SE.
APA, Harvard, Vancouver, ISO, and other styles
5

McGee, Steven, Randi McGee-Tekula, Jennifer Duck, Lucia Dettori, Don Yanek, Andrew M. Rasmussen, Ronald I. Greenberg, and Dale F, Reed. Does Exploring Computer Science Increase Computer Science Enrollment? The Learning Partnership, April 2018. http://dx.doi.org/10.51420/conf.2018.1.

Full text
Abstract:
This study investigated the impact of the Exploring Computer Science (ECS) program on the likelihood that students of all races and gender would pursue further computer science coursework in high school. ECS is designed to foster deep engagement through equitable inquiry around computer science concepts. The results indicate that students who pursued ECS as their first course were more likely to pursue another course relative to taking a traditional course as the first course.
APA, Harvard, Vancouver, ISO, and other styles
6

Lydon, Michael, and Jessie Ford. Computer Science Career Network. Fort Belvoir, VA: Defense Technical Information Center, March 2013. http://dx.doi.org/10.21236/ada578200.

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

Rosenthal, Robert. Computer science and technology :. Gaithersburg, MD: National Bureau of Standards, 1987. http://dx.doi.org/10.6028/nbs.ir.87-3516.

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

Anderson, Loren James, and Marion Kei Davis. Functional Programming in Computer Science. Office of Scientific and Technical Information (OSTI), January 2016. http://dx.doi.org/10.2172/1237221.

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

Ramamritham, Krithi. Computer Science Research in India. Fort Belvoir, VA: Defense Technical Information Center, October 1995. http://dx.doi.org/10.21236/ada300848.

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

Shafer, S., R. Bryant, J. Wing, B. Myers, and J. Reynolds. Basic Research in Computer Science. Fort Belvoir, VA: Defense Technical Information Center, December 1993. http://dx.doi.org/10.21236/ada275184.

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