2529 search results - page 139 / 506 » The Logical Structure of Binding |
173
Voted
GG
2004
Springer
16 years 7 days ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
220
click to vote
ASP
2003
Springer
16 years 2 days ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
168
click to vote
ENTCS
2010
15 years 7 months ago
2010
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in whi...
143
click to vote
ICCD
1991
IEEE
15 years 10 months ago
1991
IEEE
This article proposes a completion-detection method for efficiently implementing Boolean functions as self-timed logic structures. Current-Sensing Completion Detection, CSCD, allow...
197
click to vote
WOLLIC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This paper presents a new version of the CL contract specification language. CL combines deontic logic with propositional dynamic logic but it applies the modalities exc...