2911 search results - page 145 / 583 » A Theory of Expressiveness in Mechanisms |
188
click to vote
IJAR
2008
15 years 6 months ago
2008
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
170
click to vote
ENTCS
2006
15 years 6 months ago
2006
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...
175
click to vote
LOGCOM
2007
15 years 6 months ago
2007
Structural causal models offer a popular framework for exploring causal concepts. However, due to their limited expressiveness, structural models have difficulties coping with su...
162
click to vote
TCS
2002
15 years 6 months ago
2002
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
131
click to vote
SIGDIAL
2010
15 years 4 months ago
2010
Van der Sandt's algorithm for handling presupposition is based on a "presupposition as anaphora" paradigm and is expressed in the realm of Kamp's DRT. In recen...