5378 search results - page 311 / 1076 » Base Logics in Argumentation |
172
click to vote
ENTCS
2007
15 years 6 months ago
2007
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
211
click to vote
JAIR
2012
13 years 9 months ago
2012
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
175
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
—Commitments based on branching time logic are powerful representations for modeling multi-agent interactions. Current approaches into commitments have conceived these representa...
169
click to vote
LPNMR
2009
Springer
16 years 1 months ago
2009
Springer
We define the semantics of logic programs with (abstract) constraint atoms in a way closely tied to default logic. Like default logic, formulas in rules are evaluated using the cl...
191
Voted
FOSSACS
2001
Springer
15 years 11 months ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...