2911 search results - page 18 / 583 » A Logic of Graph Constraints |
121
click to vote
ICLP
1997
Springer
15 years 4 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
127
click to vote
WFLP
2000
Springer
15 years 4 months ago
2000
Springer
We describe the current status of the development of CFLP, a system which aims at the integration of the best features of functional logic programming (FLP), cooperative constrain...
189
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
117
click to vote
LICS
2005
IEEE
15 years 6 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
99
Voted
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
The system of Peirce’s existential graphs is a diagrammatic version of first order logic. To be more precisely: As Peirce wanted to develop a logic of relatives (i.e., relations...