Sciweavers

601 search results - page 19 / 121
» Quantified Equality Constraints
Sort
View
CIRA
2007
IEEE
136views Robotics» more  CIRA 2007»
14 years 4 months ago
Algebraic interval constraint driven exploration in human-agent collaborative problem solving
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
Yan Wang
SLOGICA
2008
99views more  SLOGICA 2008»
13 years 8 months ago
Decidable Cases of First-order Temporal Logic with Functions
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
Walter Hussak
AI
2001
Springer
14 years 2 months ago
Search Techniques for Non-linear Constraint Satisfaction Problems with Inequalities
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
CORR
2008
Springer
89views Education» more  CORR 2008»
13 years 10 months ago
Model Checking Positive Equality-free FO: Boolean Structures and Digraphs of Size Three
We study the model checking problem, for fixed structures A, over positive equality-free first-order logic
Barnaby Martin
DLT
2008
13 years 11 months ago
Tree Automata with Global Constraints
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison