Sciweavers

157 search results - page 18 / 32
» Debugging formal specifications using simple counterstrategi...
Sort
View
VLDB
1990
ACM
143views Database» more  VLDB 1990»
13 years 11 months ago
Synthesizing Database Transactions
Database programming requires having the knowledge of database semantics both to maintain database integrity and to explore more optimization opportunities. Automated programming ...
Xiaolei Qian
CP
1998
Springer
13 years 11 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
TCS
2008
13 years 7 months ago
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
Jean-François Dufourd
DIAGRAMS
2004
Springer
13 years 11 months ago
Towards a Default Reading for Constraint Diagrams
Constraint diagrams are a diagrammatic notation which may be used to express logical constraints. They were designed to complement the Unified Modeling Language in the development ...
Andrew Fish, John Howse
AAAI
1998
13 years 9 months ago
Abductive Planning with Sensing
In abductive planning, plans are constructed as reasons for an agent to act: plans are demonstrations in logical theory of action that a goal will result assuming that given actio...
Matthew Stone