Sciweavers

3244 search results - page 224 / 649
» Extensions to Description Logics
Sort
View
FSTTCS
2004
Springer
15 years 12 months ago
Who is Pointing When to Whom?
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each othe...
Dino Distefano, Joost-Pieter Katoen, Arend Rensink
ASP
2003
Springer
15 years 11 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch
IGPL
2008
77views more  IGPL 2008»
15 years 6 months ago
On Ignorance and Contradiction Considered as Truth-Values
A critical view of the alleged significance of Belnap four-valued logic for reasoning under inconsistent and incomplete information is provided. The difficulty lies in the confusi...
Didier Dubois
ENTCS
2007
104views more  ENTCS 2007»
15 years 6 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
TC
1998
15 years 6 months ago
Using Decision Diagrams to Design ULMs for FPGAs
—Many modern Field Programmable Logic Arrays (FPGAs) use lookup table (LUT) logic blocks which can be programmed to realize any function of a fixed number of inputs. It is possib...
Zeljko Zilic, Zvonko G. Vranesic