103 search results - page 7 / 21 » Proof Systems for Effectively Propositional Logic |
TABLEAUX
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
LOGCOM
2002
13 years 7 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
CLIMA
2004
13 years 8 months ago
2004
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
BMCBI
2011
13 years 2 months ago
2011
Background: Remote homology detection is a hard computational problem. Most approaches have trained computational models by using either full protein sequences or multiple sequenc...
CSL
2003
Springer
14 years 19 days ago
2003
Springer
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...