Sciweavers

1912 search results - page 195 / 383
» On the evaluation of argumentation formalisms
Sort
View
AISC
2004
Springer
15 years 10 months ago
Four Approaches to Automated Reasoning with Differential Algebraic Structures
While implementing a proof for the Basic Perturbation Lemma (a central result in Homological Algebra) in the theorem prover Isabelle one faces problems such as the implementation o...
Jesús Aransay, Clemens Ballarin, Julio Rubi...
AAAI
2007
15 years 8 months ago
Autonomous Development of a Grounded Object Ontology by a Learning Robot
We describe how a physical robot can learn about objects from its own autonomous experience in the continuous world. The robot identifies statistical regularities that allow it t...
Joseph Modayil, Benjamin Kuipers
FORTE
2004
15 years 8 months ago
Automatized Verification of Ad Hoc Routing Protocols
Numerous specialized ad hoc routing protocols are currently proposed for use, or being implemented. Few of them have been subjected to formal verification. This paper evaluates two...
Oskar Wibling, Joachim Parrow, Arnold Neville Pear...
COLING
1994
15 years 7 months ago
XTAG System - A Wide Coverage Grammar for English
This paper presents the XTAG system, a grammar development tool based on the Tree Adjoining Grammar (TAG) formalism that includes a wide-coverage syntactic grammar for English. Th...
Christine Doran, Dania Egedi, Beth Ann Hockey, Ban...
CORR
2010
Springer
85views Education» more  CORR 2010»
15 years 6 months ago
Optimally Solving the MCM Problem Using Pseudo-Boolean Satisfiability
In this report, we describe three encodings of the multiple constant multiplication (MCM) problem to pseudo-boolean satisfiability (PBS), and introduce an algorithm to solve the M...
Nuno P. Lopes, Levent Aksoy, Vasco M. Manquinho, J...