Sciweavers

2911 search results - page 18 / 583
» A Logic of Graph Constraints
Sort
View
ICLP
1997
Springer
14 years 2 months ago
Automatic Termination Analysis of Logic Programs
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...
Naomi Lindenstrauss, Yehoshua Sagiv
WFLP
2000
Springer
163views Algorithms» more  WFLP 2000»
14 years 1 months ago
Cooperative Constraint Functional Logic Programming
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...
Mircea Marin, Tetsuo Ida
CP
2009
Springer
14 years 10 months ago
From Model-Checking to Temporal Logic Constraint Solving
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...
Aurélien Rizk, François Fages
LICS
2005
IEEE
14 years 3 months ago
Model-Checking Hierarchical Structures
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
Markus Lohrey
ICCS
2007
Springer
14 years 4 months ago
Constants and Functions in Peirce's Existential Graphs
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...
Frithjof Dau