4126 search results - page 202 / 826 » Set based logic programming |
147
click to vote
ACL
1997
15 years 4 months ago
1997
In this paper we describe an approach to constraint based syntactic theories in terms of finite tree automata. The solutions to constraints expressed in weak monadic second order ...
133
Voted
LANMR
2007
15 years 4 months ago
2007
Abstract We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, chang...
131
Voted
CAL
2007
15 years 2 months ago
2007
—The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. ...
144
Voted
DEON
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. In this paper we investigate how to model legal abrogation and annulment in Defeasible Logic. We examine some options that embed in this setting, and similar rule-based s...
228
Voted
POPL
2004
ACM
16 years 2 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...