Cirquent calculus is a proof system manipulating circuit-style constructs rather than formulas. Using it, this article constructs a sound and complete axiomatization CL16 of the propositional fragment of computability logic (the game-semantically conceived logic of computational problems - see http://www.csc.villanova.edu/~japaridz/CL/ ) whose logical vocabulary consists of negation and paralle...

The paper introduces a modal logical system for reasoning about knowledge in which information available to agents might be constrained by the available budget. Although the system lacks an equivalent of the standard Negative Introspection axiom from epistemic logic S5, it is proven to be sound and complete with respect to an S5-like Kripke semantics.

The article investigates epistemic properties of information flow under communication protocols with a given topological structure of the communication network. The main result is a sound and complete logical system that describes all such properties. The system consists of a variation of the multi-agent epistemic logic S5 extended by a new network-specific Gateway axiom.

We present a Prolog program that implements a sound and complete theorem prover for rst-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an additional string uniica-tion to ensure the particular restrictions in intuitionistic logic. Due to the modular treatment of the diierent logical connectives the implementation can easily be adapted to deal with other n...

The abstract interpretation of programs relates the exact semantics of a programming language to a finite approximation of those semantics. In this article, we describe an approach to abstract interpretation that is based in logic and logic programming. Our approach consists of faithfully representing a transition system within logic and then manipulating this initial specification to create a ...

We study a weakening of the notion of logical relations, called prelogical relations, that has many of the features that make logical relations so useful as well as further algebraic properties including composability. The basic idea is simply to require the reverse implication in the definition of logical relations to hold only for pairs of functions that are expressible by the same lambda ter...

PLC Automata are a class of real time automata suitable to describe the behaviour of polling real time systems PLC Automata can be compiled to source code for PLCs a hardware widely used in industry to control processes Also PLC Automata have been equipped with a logical and operational semantics using Duration Calculus DC and Timed Automata TA respectively The three main results of this paper ...

Traditionally, the emphasis on the development of logical systems for databases has been to provide a system that is both sound and complete and with definable expressiveness. This article discusses the nature and the role of logics which relax the soundness criteria in order to enhance both the expressiveness and the implemented performance of a system based on it. It will be argued that syste...

Humans can at least apparently conduct deductive reasoning. Various logical inference systems have been developed in order to characterize such human reasoning. The strength of such a properly logical analysis of human reasoning lies in its productivity and predictive power; it enables the theorist to define precisely which data-space the theory covers and then mathematically prove that the the...