2722 search results - page 279 / 545 » Automating Language Evolution |
138
click to vote
KR
2010
Springer
15 years 9 months ago
2010
Springer
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as p...
124
click to vote
KR
2010
Springer
15 years 9 months ago
2010
Springer
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resource-sensitive nature, linear l...
157
click to vote
ICLP
2001
Springer
15 years 9 months ago
2001
Springer
We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negation...
146
click to vote
LPAR
2001
Springer
15 years 9 months ago
2001
Springer
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
128
click to vote
LICS
2000
IEEE
15 years 9 months ago
2000
IEEE
Concurrent ML is an extension of Standard ML with π-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled...