4401 search results - page 454 / 881 » Computing with Default Logic |
237
click to vote
SAS
1992
Springer
15 years 11 months ago
1992
Springer
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
189
click to vote
DLOG
2007
15 years 9 months ago
2007
We develop a formal framework for modular ontologies by analysing four notions of conservative extensions and their applications in refining, re-using, merging, and segmenting ont...
171
click to vote
ACL
2000
15 years 8 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
135
click to vote
ACL
1992
15 years 8 months ago
1992
We present a new compositional tense-aspect deindexing mechanism that makes use of tense trees as components of discourse contexts. The mechanism allows reference episodes to be c...
162
click to vote
AML
2010
15 years 7 months ago
2010
We investigate the development of terms during cut-elimination in first-order logic and Peano arithmetic for proofs of existential formulas. The form of witness terms in cut-free p...