518 search results - page 38 / 104 » Automating Proofs in Category Theory |
100
click to vote
DLOG
2008
15 years 2 months ago
2008
The paper addresses the problem of explaining some reasoning tasks associated with the DL-Lite Description Logic. Because of the simplicity of the language, standard concept level ...
FLOPS
2008
Springer
15 years 1 months ago
2008
Springer
Bundy and Richardson [7] presented a technique for reasoning about lists using ellipsis (the dots in 1+2+...+10), where a polymorphic function, denoted by 2, is used to encapsulate...
114
click to vote
JSW
2008
14 years 12 months ago
2008
Automated negotiation is an important applying field of agent theory and technology. For the current agent theoretical models have some troubles in explaining the agent's nego...
102
click to vote
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
—There are two usual ways to describe equality in a dependent typing system, one that uses an external notion of computation like beta-reduction, and one that introduces a typed ...
123
click to vote
ICFP
2010
ACM
15 years 28 days ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...