Sciweavers

529 search results - page 35 / 106
» Simple Random Logic Programs
Sort
View
ECAI
2004
Springer
14 years 3 months ago
New Insights on the Intuitionistic Interpretation of Default Logic
In this work we further investigate the relation, first found by Truszczy´nski, between modal logic S4F and Default Logic (DL), analyzing some interesting properties and showing ...
Pedro Cabalar, David Lorenzo
JSAC
2007
63views more  JSAC 2007»
13 years 9 months ago
A new survivable mapping problem in IP-over-WDM networks
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
Chang Liu, Lu Ruan
TCS
2011
13 years 4 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
ECAI
2004
Springer
14 years 3 months ago
From Knowledge-Based Programs to Graded Belief-Based Programs Part I: On-Line Reasoning
Knowledge-based programs (KBPs) are a powerful notion for expressing action policies in which branching conditions refer to implicit knowledge and call for a deliberation task at e...
Noël Laverny, Jérôme Lang
AAMAS
2006
Springer
13 years 10 months ago
Verifying Multi-agent Programs by Model Checking
Abstract. This paper gives an overview of our recent work on an approach to verifying multi-agent programs. We automatically translate multi-agent systems programmed in the logic-b...
Rafael H. Bordini, Michael Fisher, Willem Visser, ...