499 search results - page 48 / 100 » Logic Programming in a Fragment of Intuitionistic Linear Log... |
129
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
167
click to vote
EUSFLAT
2009
15 years 2 months ago
2009
This paper uses a constraint set approach to linear programming problems with equality constraints whose coefficients and/or right-hand side values could be uncertain. We consider ...
137
click to vote
DLOG
2009
15 years 2 months ago
2009
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
142
click to vote
JSAC
2007
15 years 4 months ago
2007
— We introduce a new version of the widely studied survivable mapping problem in IP-over-WDM networks. The new problem allows augmenting the given logical topology and is describ...
115
click to vote
MLQ
2007
15 years 4 months ago
2007
We define two notions for intuitionistic predicate logic: that of a submodel of a Kripke model, and that of a universal sentence. We then prove a corresponding preservation theor...