1835 search results - page 96 / 367 » Classifying Description Logics |
149
Voted
CADE
1992
Springer
15 years 7 months ago
1992
Springer
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
153
Voted
CLIMA
2006
15 years 5 months ago
2006
FLUX is a declarative, CLP-based programming method for the design of agents that reason logically about their actions and sensor information in the presence of incomplete knowledg...
139
Voted
DAGSTUHL
2003
15 years 5 months ago
2003
Abstract. Hydra is a domain-specific language for designing digital circuits, which is implemented by embedding within Haskell. Many features required for hardware specification ...
118
Voted
COLING
1992
15 years 5 months ago
1992
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make li...
152
click to vote
LOGCOM
2000
15 years 3 months ago
2000
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...