A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Resolution games and non-liftable resolution orderings
[chapter]
1995
Lecture Notes in Computer Science
Preserved Fulltext
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like saturation. ...
This is possible because of a new proof method wich avoids making use of the standard ordered lifting theorem. This proof method is based on resolution games. ...
It is for these reasons that we will study resolution with non-liftable orderings here. We will prove two completeness theorems for two types of non-liftable orderings. ...
doi:10.1007/bfb0022263
fatcat:nn6syq5aqbcynfkehjzmp3bspa
Resolution Games and Non-Liftable Resolution Orderings
[chapter]
1996
Collegium Logicum
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable orderings, without the need for any additional rules like saturation. ...
This is possible because of a new proof method wich avoids making use of the standard ordered lifting theorem. This proof method is based on resolution games. ...
It is for these reasons that we will study resolution with non-liftable orderings here. We will prove two completeness theorems for two types of non-liftable orderings. ...
doi:10.1007/978-3-7091-9461-4_1
fatcat:q5impib5ibewzjgvw5jdfqk664
A classification of non-liftable orders for resolution
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf.
In this paper we study the completeness of resolution when it is restricted by a non-liftable order and by weak subsumption. A non-liftable order is an order that does not satisfy A ≺ B ⇒ AΘ ≺ BΘ. ...
The problem of the completeness of resolution with non-liftable orders was left open in ([Nivelle96] ). ...
In this paper we will distinguish 2 types of non-liftable orders, weakly and strongly non-liftable orders. In order to be compatible with non-liftable orders, subsumption also has to be weakened. ...
doi:10.1007/3-540-63104-6_33
fatcat:pcjycskfmfaynaecsoarljn35y
Deciding the E+-class by an a posteriori, liftable order
2000
Annals of Pure and Applied Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that the E + -class can be decided by resolution using a liftable order, when the order is applied a posteriori. ...
This is a surprising result, because the decision procedure for the E + -class was one of the motivations for the study of non-liftable orders. ...
Leitsch and U. Hustadt led to improvements of this paper. ...
doi:10.1016/s0168-0072(00)00013-0
fatcat:plyv5hdvpfb2flizufkmm7e4ve
Page 2073 of Mathematical Reviews Vol. , Issue 98D
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Neculai Curteanu (R-IASI-SM; Iasi)
98d:03022 03B35 68T15
de Nivelle, Hans (NL-DELF-CS; Delft)
Resolution games and non-liftable resolution orderings. ...
Summary: “We prove the completeness of the combination of ordered resolution and factoring for a large class of non-liftable
03B General logic
984:03027
orderings, without the need for any additional rules ...
Deciding the guarded fragments by resolution
2003
Journal of symbolic computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we give resolution-based decision procedures for the GF and for the loosely guarded fragment (LGF) (sometimes also called the pairwise guarded fragment). ...
The guarded fragment (GF) is a fragment of first-order logic that has been introduced for two main reasons: first, to explain the good computational and logical behaviour of propositional modal logics. ...
Acknowledgements We would like to thank the anonymous referees for their comments, and the Editor-in-Chief for his help during the publication process. ...
doi:10.1016/s0747-7171(02)00092-5
fatcat:6aek6u3yqbc27mcbe6tbc2x4yy
Splitting Syzygies
2000
Journal of Algebra
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this way, we generalize results obtained previously in the context of deformations defined by regular sequences that had application in deformation theory and the theory of maximal Cohen᎐ Macaulay modules ...
Indeed a little experimentation shows that we can generate the full minimal free resolution F by viewing the process as a game which begins ؒ Ž in degree 2 and proceeds according to the following inductive ...
Ž . so that Tor R, N s 0, i G 1: this is because z and y are non-zeroi divisors on N, and because x is also a non-zerodivisor on N, so, for p, q g N, xy 2 p q xz 2 q s 0 ª y 2 p q z 2 q s 0 ª p s yz 2 ...
doi:10.1006/jabr.2000.8295
fatcat:efela4xbtvd4tjsbdl2gnzylgq
Page 1413 of Mathematical Reviews Vol. , Issue 97C
[page]
1997
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Contents: Hans de Nivelle, Resolution games and non-liftable resolution orderings (1-20); Manfred Kerber and Michael Kohlhase, A tableau calculus for partial functions (21-49); Ger- not Salzer, MUltlog ...
Contents: Makoto Takahashi [Makoto Takahashi'], On un- countable representability of cBa under ~CH (Japanese) (1-9); Masahiro Yasumoto, Bounded second order arithmetic (Japan- ese) (10-19); Katsuya Eda ...
Page 3220 of Mathematical Reviews Vol. , Issue 98E
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Jerrum (4-EDIN-C; Edinburgh)
98e:68222 68T15 03B35 de Nivelle, Hans (NL-DELF-CS; Deift)
Resolution games and non-liftable resolution orderings. ...
We show that the
minimum achievable difference is on the order of the square root
of the number of mistakes of the best expert, and we give efficient
algorithms that achieve this. ...
A resolution decision procedure for the guarded fragment
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Kirchner and H. Kirchner (Eds.): Automated Deduction, CADE-15 ...
We give a resolution based decision procedure for the guarded fragment of [ANB96] . The relevance of the guarded fragment lies in the fact that many modal logics can be translated into it. ...
In order to do this define the following resolution game Q = (P, A,-<), and initial clause set Cg : -The set P of literals equals the set of literals that occur in the Herbrand set. ...
doi:10.1007/bfb0054260
fatcat:mcex3fmv65d4pmz75ja2xo57ly
Page 2184 of Mathematical Reviews Vol. , Issue 2001D
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
order (219-232); Jaap van Oosten and Alex K. ...
, On stationary reflection principles (83-106); Kai Hauser, Definable sets of real numbers, infinite games and core model theory (107 120); Alexander S. ...
An approach to learning mobile robot navigation
1995
Robotics and Autonomous Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
With increasing experience, EBNN employs domain knowledge to explain and to analyze training data in order to generalize in a more knowledgeable way. ...
This paper describes an approach to learning a simple indoor robot navigation task through trial-and-error. ...
Acknowledgment The author thanks Tom Mitchell, Ryusuke Masuoka, Joseph O'Sullivan, Reid Simmons, and the CMU mobile robot group for their invaluable advice and support. ...
doi:10.1016/0921-8890(95)00022-8
fatcat:mmzhp4xz7nfpbcajdxe4fhtpna
Inducing logic programs with genetic algorithms: the Genetic Logic Programming System
1995
IEEE Expert
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This representation facilitates the generation of initial logic programs and other genetic operators. ...
Inductive Logic Programming (ILP) integrates the techniques from traditional machine learning and logic programming to construct logic programs from training examples. ...
However, these strategies and heuristics are not always applicable because they may trap the systems in local maxima. In order to overcome this problem, non greedy strategies should be adopted. ...
doi:10.1109/64.464935
fatcat:k5ka55sfivcf3bfznderhu5l7a
On rank one log del Pezzo surfaces in characteristic different from two and three
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2005.14544v2 fatcat:bgiabecswfaxnfwb6txu6yu2daOther Versions
We classify all log del Pezzo surfaces of Picard number one defined over algebraically closed fields of characteristic different from two and three. ...
For example, we show that log del Pezzo surfaces of Picard number one defined over algebraically closed fields of characteristic higher than five admit a log resolution that lifts to characteristic zero ...
Non liftable examples in low characteristic. ...
arXiv:2005.14544v3
fatcat:co2jlb7z25bwbmcakoh63jg7oy
The Design of Lil'Flo, a Socially Assistive Robot for Upper Extremity Motor Assessment and Rehabilitation in the Community Via Telepresence
[article]
2020
medRxiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The system combines traditional telepresence and computer vision with a humanoid, who can play games with patients and guide them in a present and engaging way under the supervision of a remote clinician ...
, while useful, fails to deliver the rich interactions and data needed for motor rehabilitation and assessment. ...
Laura Prosser and Dr. John Chuo. ...
doi:10.1101/2020.04.07.20047696
fatcat:igs4dfxjzbe77d5zh6veemfxs4
« Previous
Showing results 1 — 15 out of 56 results