2920 search results - page 319 / 584 » Finite information logic |
186
click to vote
ICLP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...
163
click to vote
FUZZY
2001
Springer
15 years 11 months ago
2001
Springer
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
181
click to vote
CSL
1999
Springer
15 years 11 months ago
1999
Springer
This paper describes a new data structure, difference decision diagrams (DDDs), for representing a Boolean logic over inequalities of the form ¡£¢¥¤§¦©¨ and ¡¢¥¤...
166
Voted
TOOLS
1998
IEEE
15 years 11 months ago
1998
IEEE
In traditional information systems, the user interface is controlled by one single application. In distributed systems, several distributed components may want to influence the ap...
193
click to vote
RTSS
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....