Sciweavers

438 search results - page 15 / 88
» constraints 1998
Sort
View
ECP
1999
Springer
157views Robotics» more  ECP 1999»
13 years 11 months ago
SAT-Based Procedures for Temporal Reasoning
In this paper we study the consistency problem for a set of disjunctive temporal constraints [Stergiou and Koubarakis, 1998]. We propose two SAT-based procedures, and show that—o...
Alessandro Armando, Claudio Castellini, Enrico Giu...
AI
1998
Springer
13 years 7 months ago
Reasoning About Actions: Steady Versus Stabilizing State Constraints
In formal approaches to commonsense reasoning about actions. the Ramification Problem denotes the problem of handling indirect effects which implicitly derive from so-called state...
Michael Thielscher
CC
1998
Springer
134views System Software» more  CC 1998»
13 years 11 months ago
Flow Logics for Constraint Based Analysis
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
Hanne Riis Nielson, Flemming Nielson
CORR
1998
Springer
107views Education» more  CORR 1998»
13 years 7 months ago
Computing Declarative Prosodic Morphology
This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a re...
Markus Walther
TPLP
2010
102views more  TPLP 2010»
13 years 5 months ago
As time goes by: Constraint Handling Rules
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers,...
Jon Sneyers, Peter Van Weert, Tom Schrijvers, Lesl...