The advances in innovation will send people to Mars soon. Web of things, 5G, computerized reasoning, mechanized driving, etc and on, presumably nobody can list every one of the new advancements that are arising. The intricacy of the innovative world is brilliant yet similarly as…
Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, one can achieve low logical error r...
We explore an inquisitive modal logic designed to reason about neighborhood models. This logic is based on an inquisitive strict conditional operator, which quantifies over neighborhoods, and which can be applied to both statements and questions. In...
Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are inter...
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete for all int...
Classical logics for strategic reasoning, such as Coalition Logic and Alternating-time Temporal Logic, formalize absolute strategic reasoning about the unconditional strategic abilities of agents to achieve their goals. Goranko and Ju, in two recent...
Coalition Logic is an important logic in logical research on strategic reasoning. In two recent papers, Li and Ju argued that generally, concurrent game models, models of Coalition Logic, have three too strong assumptions: seriality, independence of...
Coalition Logic is a central logic in logical research on strategic reasoning. In a recent paper, Li and Ju argued that generally, models of Coalition Logic, concurrent game models, have three too strong assumptions: seriality, independence of agents...
Probabilistic logic programming is a programming paradigm that extends logic programming with probabilities. Most approaches to probabilistic logic programming
An edited version is given of the text of Gödel's unpublished manuscript of the notes for a course in basic logic he delivered at the University of Notre Dame in 1939. Gödel's notes deal with what is today considered as important logical problems p...
This could be an entitled person's story but since I complied with a client's logic, I felt it belonged here. I used to work as a personal auto insurance liability adjuster and my job was to investiga...
Multi-attributed relational structures (MARSs) have been proposed as a formal data model for generalized property graphs, along with multi-attributed rule-based predicate logic (MARPL) as a useful rule-based logic in which to write inference rules ov...
In modal logic, semantic consequence is usually defined locally by truth preservation at all worlds in all models (with respect to a class of frames). It can also be defined globally by truth preservation in all models (with respect to a class of fra...
This paper discusses system consequence, a central idea in the project to lift the theory of information flow to the abstract level of universal logic and the theory of institutions. The theory of information flow is a theory of distributed logic. Th...
We propose a novel approach to logic-based learning which generates assumption-based argumentation (ABA) frameworks from positive and negative examples, using a given background knowledge. These ABA frameworks can be mapped onto logic programs with n...
Around 2000, J.-Y. Girard developed a logical theory, called Ludics. This theory was a step in his program of Geometry of Interaction, the aim of which being to account for the dynamics of logical proofs. In Ludics, objects called designs keep only w...
We introduce a fragment of continuous first-order logic, analogue of Palyutin formulas (or h-formulas) in classical model theory, which is preserved under reduced products in both directions. We use it to extend classical results on complete theories...
The Eleventh Workshop on Logic Programming Environments (WLPE'01) was one in a series of international workshops in the topic area. It was held on December 1, 2001 in Paphos, Cyprus as a post-conference workshop at ICLP 2001. Eight refereed papers...
An SSH tunneling solution for remote Mac-to-Mac connectivity (formerly a Mac-MSP product) (⭐ 41)