Milne P (2016) A non-classical refinement of the interpolation property for classical propositional logic. Logique et Analyse, 59 (235), pp. 273-281. http://virthost ...

This is a preview. Log in through your library . Abstract We conducted a computer-based psychological experiment in which a random mix of 40 tautologies and 40 non-tautologies were presented to the ...

A (normal) system of propositional modal logic is said to be complete iff it is characterized by a class of (Kripke) frames. When we move to modal predicate logic the question of completeness can ...

Automated theorem prover for propositional logic which uses sequent calculus. Written in MAXIMA. As a research assistant in Tampere University I was tasked with creating moodle exercises using the ...

Abstract: As legal systems become increasingly complex and the demand for automated decision-making grows, there is a pressing need for tools that can assist legal professionals in applying legal ...

Implementaion of SAT and WALKSAT algorithms to find solutions to many propositional logic clauses. Designed to solve Sudoku puzzles (though the Sudoku code was created by Dartmouth, not me).

In this paper we show that an arbitrary propositional theory, when interpreted under the answer sets semantics (called Equilibrium Logic for this general syntax), can always be reexpressed as a ...

A goal of research in artificial intelligence and machine learning since the early days of expert systems has been to develop automated reasoning methods that combine logic and probability.