English
Related papers

Related papers: When logic lays down the law

200 papers

Logic is playing an increasingly important role in the engineering of real-time, hybrid, and cyber-physical systems, but mostly in the form of posterior verification and high-level analysis. The core methodology in the design of real-world…

Logic in Computer Science · Computer Science 2014-09-16 Sicun Gao

Logic programming is a flexible programming paradigm due to the use of predicates without a fixed data flow. To extend logic languages with the compact notation of functional programming, there are various proposals to map evaluable…

Programming Languages · Computer Science 2022-05-17 Michael Hanus

Logicians study and apply a multiplicity of various logical systems. Consequently, there is necessity to build foundations and common grounds for all these systems. This is done in metalogic. Like metamathematics studies formalized…

Logic · Mathematics 2007-05-23 Mark Burgin

Transparency is a key requirement for ethical machines. Verified ethical behavior is not enough to establish justified trust in autonomous intelligent agents: it needs to be supported by the ability to explain decisions. Logic Programming…

Computers and Society · Computer Science 2020-09-24 Abeer Dyoub , Stefania Costantini , Francesca A. Lisi

Some approaches to increasing program reliability involve a disciplined use of programming languages so as to minimise the hazards introduced by error-prone features. This is realised by writing code that is constrained to a subset of the a…

Programming Languages · Computer Science 2007-11-06 Guillem Marpons-Ucero , Julio Mariño , Ángel Herranz , Lars-Åke Fredlund , Manuel Carro , Juan José Moreno-Navarro

In a recently launched research program for developing logic as a formal theory of (interactive) computability, several very interesting logics have been introduced and axiomatized. These fragments of the larger Computability Logic aim not…

Logic in Computer Science · Computer Science 2013-04-02 Matthew S. Bauer

Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible…

Logic in Computer Science · Computer Science 2010-03-26 Giorgi Japaridze

The notion that algorithmic systems should be "transparent" and "explainable" is common in the many statements of consensus principles developed by governments, companies, and advocacy organizations. But what exactly do policy and legal…

Machine Learning · Computer Science 2023-09-18 Matthew O'Shaughnessy

There is a strong consensus that combining the versatility of machine learning with the assurances given by formal verification is highly desirable. It is much less clear what verified machine learning should mean exactly. We consider this…

Machine Learning · Computer Science 2021-02-15 Tonicha Crook , Jay Morgan , Arno Pauly , Markus Roggenbach

Recent technological advances have led to unprecedented amounts of generated data that originate from the Web, sensor networks and social media. Analytics in terms of defeasible reasoning - for example for decision making - could provide…

Logic in Computer Science · Computer Science 2021-02-16 Michael J. Maher , Ilias Tachmazidis , Grigoris Antoniou , Stephen Wade , Long Cheng

Understanding and adhering to traffic regulations is essential for autonomous vehicles to ensure safety and trustworthiness. However, traffic regulations are complex, context-dependent, and differ between regions, posing a major challenge…

Artificial Intelligence · Computer Science 2025-11-20 Tianhui Cai , Yifan Liu , Zewei Zhou , Haoxuan Ma , Seth Z. Zhao , Zhiwen Wu , Xu Han , Zhiyu Huang , Jiaqi Ma

Partial correctness of imperative or functional programming divides in logic programming into two notions. Correctness means that all answers of the program are compatible with the specification. Completeness means that the program produces…

Logic in Computer Science · Computer Science 2025-08-26 Włodzimierz Drabent

The design and analysis of systems that combine computational behaviour with physical processes' continuous dynamics - such as movement, velocity, and voltage - is a famous, challenging task. Several theoretical results from programming…

Systems and Control · Electrical Eng. & Systems 2024-11-22 Pedro Mendes , Ricardo Correia , Renato Neves , José Proença

Program correctness (in imperative and functional programming) splits in logic programming into correctness and completeness. Completeness means that a program produces all the answers required by its specification. Little work has been…

Logic in Computer Science · Computer Science 2014-11-13 Wlodzimierz Drabent

One of the challenges in designing safe, reliable and trustworthy Autonomous Vehicles (AVs) is to ensure that the AVs abide by traffic rules. For this, the AVs need to be able to understand and reason about traffic rules. In previous work,…

Logic in Computer Science · Computer Science 2022-09-29 Gleifer Vaz Alves , Maike Schwammberger

Formal logic enables computers to reason in natural language by representing sentences in symbolic forms and applying rules to derive conclusions. However, in what our study characterizes as "rulebreaker" scenarios, this method can lead to…

Computation and Language · Computer Science 2025-08-18 Jason Chan , Robert Gaizauskas , Zhixue Zhao

We consider multi-agent argumentation, where each agent's view of the arguments is encoded as an argumentation framework (AF). Then we study deliberative processes than can occur on this basis. We think of a deliberative process as taking…

Logic in Computer Science · Computer Science 2014-08-08 Truls Pedersen , Sjur Dyrkolbotn

Law at large underpins modern society, codifying and governing many aspects of citizens' daily lives. Oftentimes, law is subject to interpretation, debate and challenges throughout various courts and jurisdictions. But in some other areas,…

Programming Languages · Computer Science 2021-07-06 Denis Merigoux , Nicolas Chataing , Jonathan Protzenko

Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…

Computational Complexity · Computer Science 2024-09-06 Asad Khaliq

Experimental science usually relies on laboratory procedures that, after finitely many steps, terminate with numerical reports on physical quantities. This paper argues that such procedures can be understood as algorithmic once the…

History and Philosophy of Physics · Physics 2026-05-06 Isaac Pérez Castillo