Sciweavers

662 search results - page 99 / 133
» Logic Programming with Ordered Disjunction
Sort
View
89
Voted
NAACL
2007
14 years 11 months ago
Exploiting Event Semantics to Parse the Rhetorical Structure of Natural Language Text
Previous work on discourse parsing has mostly relied on surface syntactic and lexical features; the use of semantics is limited to shallow semantics. The goal of this thesis is to...
Rajen Subba
102
Voted
WFLP
2009
Springer
239views Algorithms» more  WFLP 2009»
15 years 4 months ago
Fast and Accurate Strong Termination Analysis with an Application to Partial Evaluation
A logic program strongly terminates if it terminates for any selection rule. Clearly, considering a particular selection rule—like Prolog’s leftmost selection rule—allows one...
Michael Leuschel, Salvador Tamarit, Germán ...
79
Voted
TLCA
2009
Springer
15 years 4 months ago
Lexicographic Path Induction
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
Jeffrey Sarnat, Carsten Schürmann
SEMWEB
2005
Springer
15 years 3 months ago
Preferential Reasoning on a Web of Trust
Abstract. We introduce a framework, based on logic programming, for preferential reasoning with agents on the Semantic Web. Initially, we encode the knowledge of an agent as a logi...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
77
Voted
ESOP
2004
Springer
15 years 3 months ago
Canonical Graph Shapes
Abstract. Graphs are an intuitive model for states of a (software) system that include pointer structures — for instance, object-oriented programs. However, a naive encoding resu...
Arend Rensink