Sciweavers

438 search results - page 72 / 88
» On theorem proving in annotated logics
Sort
View
AIR
2004
132views more  AIR 2004»
14 years 9 months ago
Sarcasm, Deception, and Stating the Obvious: Planning Dialogue without Speech Acts
This paper presents an alternative to the `speech acts with STRIPS' approach to implementing dialogue: a fully implemented AI planner which generates and analyses the semantic...
Debora Field, Allan Ramsay
CADE
2008
Springer
15 years 10 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
MKM
2004
Springer
15 years 3 months ago
A Graph-Based Approach Towards Discerning Inherent Structures in a Digital Library of Formal Mathematics
As the amount of online formal mathematical content grows, for example through active efforts such as the Mathweb [21], MOWGLI [4], Formal Digital Library, or FDL [1], and others, ...
Lori Lorigo, Jon M. Kleinberg, Richard Eaton, Robe...
124
Voted
ICWS
2004
IEEE
14 years 11 months ago
Logic-based Web Services Composition: From Service Description to Process Model
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...
Jinghai Rao, Peep Küngas, Mihhail Matskin
DAGSTUHL
2008
14 years 11 months ago
The Grand Challenges and Myths of Neural-Symbolic Computation
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
Luís C. Lamb