Strong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas. 1998 ACM Subject Classification D.1.6 Logic Programming, I.2.3 Deduction and Theorem Proving

This paper describes a deduction method that works both top-down and bottom-up. The method can be viewed as an extension of a well-known approach|Earley deduction|to handle negation-as-failure. We show that with respect to the stratiied model theory of 1] the method is sound, that it is strongly complete (terminating) for function-free programs with negation, and complete for programs without n...

Arithmetic circuits arise in the context of weighted logic programming languages, such as Datalog with aggregation, or Dyna. A weighted logic program defines a generalized arithmetic circuit— the weighted version of a proof forest, with nodes having arbitrary rather than boolean values. In this paper, we focus on finite circuits. We present a flexible algorithm for efficiently querying node val...

The concept of work is basic for statistical thermodynamics. To gain a fuller understanding of work and its (quantum) features, it needs to be represented as an average of a fluctuating quantity. Here I focus on the work done between two moments of time for a thermally isolated quantum system driven by a time-dependent Hamiltonian. I formulate two natural conditions needed for the fluctuating w...

. The reason for including this chapter is to make the book as selfcontained as possible. It should in particular be accessible to physicists, who normally have no training in formal logic. We present the basics of classical propositional logic and non-monotonic logic. In fact, it is possible to provide the reader with all the logical equipment he needs in order to understand the logical invest...