20294 search results - page 283 / 4059 » Algorithmic Information Theory |
152
click to vote
ENTCS
2008
15 years 6 months ago
2008
Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quant...
185
click to vote
TAGT
1998
Springer
15 years 11 months ago
1998
Springer
Reactive systems perform their tasks through interaction with their users or with other systems (as parts of a bigger system). An essential requirement for modeling such systems is...
157
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
Information systems (IS) research often attempts to examine and explain how technology leads to outcomes through usage of information technology (IT). Although extensive research ...
172
click to vote
JAIR
2010
15 years 5 months ago
2010
Grounding is the task of reducing a first-order theory and finite domain to an equivalent propositional theory. It is used as preprocessing phase in many logic-based reasoning s...
201
click to vote
IJCAI
1997
15 years 8 months ago
1997
We address the problem of introducing preferences into default logic. Two approaches are given, one a generalisation of the other. In the first approach, an ordered default theory...