It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
The information state of an agent is changed when a text (in natural language) is processed. The meaning of a text can be taken to be this information state change potential. The ...
Finding all satisfying assignments of a propositional formula has many applications in the design of hardware and software. An approach to this problem augments a clause-recording...
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...