1486 search results - page 75 / 298 » A Logically Saturated Extension of |
160
click to vote
LPAR
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
173
Voted
ICLP
2003
Springer
15 years 10 months ago
2003
Springer
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. This extension supports a conven...
134
click to vote
DSS
2007
15 years 5 months ago
2007
The use of positive and negative reasons in inference and decision aiding is a recurrent issue of investigation as far as the type of formal language to use within a DSS is concer...
138
Voted
JANCL
2008
15 years 5 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
278
click to vote
ICLP
2009
Springer
16 years 6 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...