593,917 research outputs found
The Logic of Time: from Aristotle to Computer Science
Charla tipo conferencia-seminario dada para alumnos de un másterThis short course will explore that continuous thread which connects the discussion about time in philosophy with the modern use of temporal logic in computer science. It will go through the history of temporal logic to show how ideas developed by ancient and medieval philosophy have been rediscovered in modern times and applied to solve relevant problems in computer science.
Part 1: An historical perspective on temporal logic
• Synthesis: the nature of time is a central issue of classical and medieval phylosophy • Downfall: in the Renaissance the subject loses interest and is removed from the philo-
sophical discussion • Rediscovery: in the 19th and 20th centory temporal logic become a central issue again
Part 2: Time in Computer Science
• Algorithms, states and computations • Imperative programs and Reactive programs • Temporal Logic for Computer Science: CTL and LTL • The satisfiability problem • The model checking problemUniversidad de Málaga. Campus de Excelencia Internacional AndalucĂa Tech
Introduction to Iltis: An Interactive, Web-Based System for Teaching Logic
Logic is a foundation for many modern areas of computer science. In
artificial intelligence, as a basis of database query languages, as well as in
formal software and hardware verification --- modelling scenarios using logical
formalisms and inferring new knowledge are important skills for going-to-be
computer scientists. The Iltis project aims at providing a web-based,
interactive system that supports teaching logical methods. In particular the
system shall (a) support to learn to model knowledge and to infer new knowledge
using propositional logic, modal logic and first-order logic, and (b) provide
immediate feedback and support to students. This article presents a
prototypical system that currently supports the above tasks for propositional
logic. First impressions on its use in a second year logic course for computer
science students are reported
"Boring formal methods" or "Sherlock Holmes deduction methods"?
This paper provides an overview of common challenges in teaching of logic and
formal methods to Computer Science and IT students. We discuss our experiences
from the course IN3050: Applied Logic in Engineering, introduced as a "logic
for everybody" elective course at at TU Munich, Germany, to engage pupils
studying Computer Science, IT and engineering subjects on Bachelor and Master
levels. Our goal was to overcome the bias that logic and formal methods are not
only very complicated but also very boring to study and to apply. In this
paper, we present the core structure of the course, provide examples of
exercises and evaluate the course based on the students' surveys.Comment: Preprint. Accepted to the Software Technologies: Applications and
Foundations (STAF 2016). Final version published by Springer International
Publishing AG. arXiv admin note: substantial text overlap with
arXiv:1602.0517
A Sound and Complete Axiomatization of Majority-n Logic
Manipulating logic functions via majority operators recently drew the
attention of researchers in computer science. For example, circuit optimization
based on majority operators enables superior results as compared to traditional
logic systems. Also, the Boolean satisfiability problem finds new solving
approaches when described in terms of majority decisions. To support computer
logic applications based on majority a sound and complete set of axioms is
required. Most of the recent advances in majority logic deal only with ternary
majority (MAJ- 3) operators because the axiomatization with solely MAJ-3 and
complementation operators is well understood. However, it is of interest
extending such axiomatization to n-ary majority operators (MAJ-n) from both the
theoretical and practical perspective. In this work, we address this issue by
introducing a sound and complete axiomatization of MAJ-n logic. Our
axiomatization naturally includes existing majority logic systems. Based on
this general set of axioms, computer applications can now fully exploit the
expressive power of majority logic.Comment: Accepted by the IEEE Transactions on Computer
Complexity of ITL model checking: some well-behaved fragments of the interval logic HS
Model checking has been successfully used in many computer science fields,
including artificial intelligence, theoretical computer science, and databases.
Most of the proposed solutions make use of classical, point-based temporal
logics, while little work has been done in the interval temporal logic setting.
Recently, a non-elementary model checking algorithm for Halpern and Shoham's
modal logic of time intervals HS over finite Kripke structures (under the
homogeneity assumption) and an EXPSPACE model checking procedure for two
meaningful fragments of it have been proposed. In this paper, we show that more
efficient model checking procedures can be developed for some expressive enough
fragments of HS
The prospects for mathematical logic in the twenty-first century
The four authors present their speculations about the future developments of
mathematical logic in the twenty-first century. The areas of recursion theory,
proof theory and logic for computer science, model theory, and set theory are
discussed independently.Comment: Association for Symbolic Logi
- …