3773 search results - page 679 / 755 » Logical Reasoning |
159
click to vote
CADE
2004
Springer
16 years 4 months ago
2004
Springer
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
130
Voted
CADE
2001
Springer
16 years 4 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
148
click to vote
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
145
click to vote
SEMWEB
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. OWL-S allows selecting, composing and invoking Web Serdifferent levels of abstraction: selection uses high level abstract descriptions, invocation uses low level groundi...
135
click to vote
DEXA
2004
Springer
15 years 9 months ago
2004
Springer
Data cleaning deals with the detection and removal of errors and inconsistencies in data, gathered from distributed sources. This process is essential for drawing correct conclusio...