446 search results - page 25 / 90 » Automating Theories in Intuitionistic Logic |
FM
2001
Springer
14 years 5 days ago
2001
Springer
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
ECSQARU
2003
Springer
14 years 27 days ago
2003
Springer
Abstract. Default logic is one of the best known and most studied of the approaches to nonmonotonic reasoning. Subsequently, several variants of default logic have been proposed to...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
ICLP
2009
Springer
14 years 8 months ago
2009
Springer
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...