2519 search results - page 273 / 504 » Reasoning with Textual Cases |
150
click to vote
ICLP
1998
Springer
15 years 11 months ago
1998
Springer
The eld of theory update has seen some improvement, in what regards updating, by allowing desired updates to be speci ed by update programs. The updating of models is governed by ...
171
click to vote
ICSE
1998
IEEE-ACM
15 years 11 months ago
1998
IEEE-ACM
: Despite considerable evidence to show that inspections can help reduce costs and improve quality, inspections are not widely deployed in the software industry. One of the likely ...
157
click to vote
KR
1998
Springer
15 years 10 months ago
1998
Springer
We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globallycomplete probabilistic deduction with conditional constraints ...
130
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
216
click to vote
LICS
1997
IEEE
15 years 10 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...