Sciweavers

2962 search results - page 225 / 593
» Reasoning on Association Rules
Sort
View
TIME
2005
IEEE
16 years 6 days ago
Search Strategies for Resolution in CTL-Type Logics: Extension and Complexity
A clausal resolution approach originally developed for the branching logic CTL has recently been extended to the logics ECTL and ECTL+ . In the application of the resolution rules...
Artie Basukoski, Alexander Bolotov
ASP
2001
Springer
15 years 10 months ago
Learning by Answer Sets
This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we in...
Chiaki Sakama
DLOG
2007
15 years 9 months ago
Paraconsistent Resolution for Four-valued Description Logics
Abstract. In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve thi...
Yue Ma, Pascal Hitzler, Zuoquan Lin
LPNMR
2005
Springer
16 years 3 days ago
SELP - A System for Studying Strong Equivalence Between Logic Programs
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
Yin Chen, Fangzhen Lin, Lei Li
CSL
2004
Springer
16 years 21 hour ago
Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity
The aim of this work is to give an alternative presentation for the multiplicative fragment of Yetter’s cyclic linear logic. The new presentation is inspired by the calculus of s...
Pietro Di Gianantonio