725 search results - page 66 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
156
click to vote
TARK
2005
Springer
15 years 11 months ago
2005
Springer
The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighb...
165
click to vote
CSL
2008
Springer
15 years 7 months ago
2008
Springer
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
155
click to vote
ARTMED
2010
15 years 6 months ago
2010
Objective: The programming language Arden Syntax has been optimised for use in clinical decision support systems. We describe an extension of this language named Fuzzy Arden Synta...
143
click to vote
TACS
1997
Springer
15 years 10 months ago
1997
Springer
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
181
click to vote
CSCLP
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...