Sciweavers

7868 search results - page 238 / 1574
» Learning by Answer Sets
Sort
View
ICAIL
2005
ACM
16 years 1 days ago
A question-answering system for Portuguese juridical documents
We present a Question-Answering (QA) system for Portuguese juridical documents. The QA system was applied to the complete set of decisions from several Portuguese juridical instit...
Paulo Quaresma, Irene Pimenta Rodrigues
KR
2004
Springer
15 years 11 months ago
Majority Logic
We extend graded modal logic (GML) to a logic that captures the concept of majority. We provide an axiomatization for majority logic, MJL, and sketch soundness and completeness pr...
Eric Pacuit, Samer Salame
AAAI
2004
15 years 7 months ago
Loop Formulas for Circumscription
Clark's completion is a simple nonmonotonic formalism and a special case of several nonmonotonic logics. Recently there has been work on extending completion with "loop ...
Joohyung Lee, Fangzhen Lin
DM
2006
76views more  DM 2006»
15 years 6 months ago
Lex M versus MCS-M
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem was Lex M, which was presented in 1976. A new algorithm, and a simplific...
Yngve Villanger
ARSCOM
2005
94views more  ARSCOM 2005»
15 years 6 months ago
Isometrically Embedded Graphs
Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
Debra L. Boutin