Sciweavers

1127 search results - page 41 / 226
» Theory Extension in ACL2(r)
Sort
View
TLCA
2007
Springer
15 years 6 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek
97
Voted
WWW
2004
ACM
16 years 1 months ago
A proposal for an owl rules language
Although the OWL Web Ontology Language adds considerable expressive power to the Semantic Web it does have expressive limitations, particularly with respect to what can be said ab...
Ian Horrocks, Peter F. Patel-Schneider
93
Voted
HRI
2009
ACM
15 years 7 months ago
I am my robot: the impact of robot-building and robot form on operators
As robots become more pervasive, operators will develop richer relationships with them. In a 2 (robot form: humanoid vs. car) x 2 (assembler: self vs. other) between-participants ...
Victoria Groom, Leila Takayama, Paloma Ochi, Cliff...
112
Voted
IAT
2009
IEEE
15 years 4 months ago
On the Acceptability of Meta-arguments
In this paper we introduce a theory of meta-argumentation, by using Dung’s theory of abstract argumentation to reason about itself. Metaarguments are generated from atomic argum...
Guido Boella, Leendert van der Torre, Serena Villa...
140
Voted
CADE
2007
Springer
16 years 1 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...