Sciweavers

2529 search results - page 79 / 506
» The Logical Structure of Binding
Sort
View
DALT
2007
Springer
14 years 11 months ago
Structured Argumentation in a Mediator for Online Dispute Resolution
Online dispute resolution is becoming the main method when dealing with a conflict in e-commerce. A family of defeasible reasoning patterns is used to provide a useful link betwee...
Ioan Alfred Letia, Adrian Groza
LATA
2012
Springer
13 years 5 months ago
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
Arne Meier, Johannes Schmidt, Michael Thomas, Heri...
CSL
2010
Springer
14 years 10 months ago
Randomisation and Derandomisation in Descriptive Complexity Theory
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
Kord Eickmeyer, Martin Grohe
ICCD
2000
IEEE
79views Hardware» more  ICCD 2000»
15 years 6 months ago
Efficient Logic Optimization Using Regularity Extraction
This paper presents a new method to extract functionally equivalent structures from logic netlists. It uses a fast functional regularity extraction algorithm based on structural e...
Thomas Kutzschebauch
DEON
2010
Springer
14 years 11 months ago
A Dyadic Operator for the Gradation of Desirability
We propose a normal modal deontic logic based on a dyadic operator, similar in structure to the temporal "until". By bringing significant expressiveness to the logic, it ...
Guillaume Piolle