3047 search results - page 313 / 610 » On the Meaning of Logical Completeness |
199
click to vote
ICALP
2010
Springer
16 years 8 days ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
181
click to vote
KR
2010
Springer
16 years 7 days ago
2010
Springer
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
225
click to vote
LPNMR
1993
Springer
15 years 11 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
186
click to vote
RSCTC
1993
Springer
15 years 11 months ago
1993
Springer
: While the common kinds of uncertainties in databases (e.g., null values, disjunction, corrupt/missing data, domain mismatch, etc.) have been extensively studied, a relatively une...
160
click to vote
ICLP
1990
Springer
15 years 11 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...