Sciweavers

1322 search results - page 181 / 265
» Unsound Theorem Proving
Sort
View
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
13 years 9 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal
AICOM
2010
92views more  AICOM 2010»
13 years 9 months ago
SOLAR: An automated deduction system for consequence finding
SOLAR (SOL for Advanced Reasoning) is a first-order clausal consequence finding system based on the SOL (Skip Ordered Linear) tableau calculus. The ability to find non-trivial cons...
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue, O...
AI
2007
Springer
13 years 9 months ago
Iterated belief revision, revised
The AGM postulates for belief revision, augmented by the DP postulates for iterated belief revision, provide generally accepted criteria for the design of operators by which intel...
Yi Jin, Michael Thielscher
ARSCOM
2007
77views more  ARSCOM 2007»
13 years 9 months ago
Extremal bipartite graphs with high girth
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
Camino Balbuena, Pedro García-Vázque...
AUTOMATICA
2007
152views more  AUTOMATICA 2007»
13 years 9 months ago
Analysis of undercompensation and overcompensation of friction in 1DOF mechanical systems
This paper investigates the effects of undercompensation and overcompensation of friction in PD controlled 1DOF mechanical systems. The friction force that is acting on the mechan...
Devi Putra, Henk Nijmeijer, Nathan van de Wouw