365 search results - page 62 / 73 » First-order logical filtering |
ECAI
2004
Springer
15 years 5 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
128
Voted
PODS
1994
ACM
15 years 3 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
100
Voted
AAAI
1990
15 years 25 days ago
1990
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
122
Voted
ANCS
2005
ACM
15 years 5 months ago
2005
ACM
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
186
click to vote
POPL
2008
ACM
15 years 12 months ago
2008
ACM
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...