Sciweavers

977 search results - page 142 / 196
» Logic programming with infinite sets
Sort
View
89
Voted
CADE
2003
Springer
16 years 25 days ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes
89
Voted
CADE
2009
Springer
15 years 7 months ago
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...
Shuvendu K. Lahiri, Shaz Qadeer
ARGMAS
2007
Springer
15 years 6 months ago
Defeasible Argumentation Support for an Extended BDI Architecture
Abstract. In this work, an agent architecture that combines defeasible argumentation and the BDI model is described. Argumentation will be used as a mechanism for reasoning about b...
Nicolás D. Rotstein, Alejandro Javier Garc&...
ILP
2004
Springer
15 years 5 months ago
Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
Mark Goadrich, Louis Oliphant, Jude W. Shavlik
120
Voted
AGP
2003
IEEE
15 years 5 months ago
Local Closed-World Assumptions for reasoning about Semantic Web data
Abstract The Semantic Web (SW) can be seen as abstract representation and exchange of data and metadata. Metadata is given in terms of data mark-up and reference to shared, Web-acc...
Elisa Bertino, Alessandro Provetti, Franco Salvett...