Sciweavers

3053 search results - page 105 / 611
» A Logic of Abstract Argumentation
Sort
View
CADE
2009
Springer
16 years 7 months ago
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is ess...
Carsten Fuhs, Jürgen Giesl, Michael Parting, ...
DLT
2008
15 years 8 months ago
Fixed Point and Aperiodic Tilings
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics rangin...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
ECSQARU
2009
Springer
16 years 1 months ago
Realizing Default Logic over Description Logic Knowledge Bases
Abstract. We consider a realization of Reiter-style default logic on top of description logic knowledge bases (DL-KBs). To this end, we present elegant transformations from default...
Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner
PPCP
1993
15 years 10 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
IROS
2009
IEEE
146views Robotics» more  IROS 2009»
16 years 1 months ago
A discrete-time control strategy for dynamic walking of a planar under-actuated biped robot
Abstract— This paper deals with a discret-time control approach, proposed for the control of a five-link, four-actuator planar biped walker. The approach is based on the choice ...
Ahmed Chemori