106 search results - page 6 / 22 » A logic you can count on |
182
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
171
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
In this paper, we present a new approach to the problem of inverter elimination in domino logic synthesis. A small piece of static CMOS logic is introduced to the circuit to avoid...
177
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
165
click to vote
ICDT
2007
ACM
16 years 25 days ago
2007
ACM
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
136
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Searle represents constitutive norms as count-as conditionals, written as `X counts as Y in context C'. Grossi et al. study a class of these conditionals as `in cont...