Sciweavers

2138 search results - page 256 / 428
» Logics for the Relational Syllogistic
Sort
View
CORR
2002
Springer
141views Education» more  CORR 2002»
15 years 6 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
RV
2010
Springer
220views Hardware» more  RV 2010»
15 years 4 months ago
Runtime Verification with the RV System
The RV system is the first system to merge the benefits of Runtime Monitoring with Predictive Analysis. The Runtime Monitoring portion of RV is based on the successful Monitoring O...
Patrick O'Neil Meredith, Grigore Rosu
ICML
2007
IEEE
16 years 7 months ago
Learning from interpretations: a rooted kernel for ordered hypergraphs
The paper presents a kernel for learning from ordered hypergraphs, a formalization that captures relational data as used in Inductive Logic Programming (ILP). The kernel generaliz...
Gabriel Wachman, Roni Khardon
CADE
2003
Springer
16 years 6 months ago
Proof Search and Proof Check for Equational and Inductive Theorems
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
Eric Deplagne, Claude Kirchner, Hélè...
CADE
2001
Springer
16 years 6 months ago
NP-Completeness of Refutability by Literal-Once Resolution
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
Stefan Szeider