Sciweavers

3634 search results - page 305 / 727
» The Field Representation Language
Sort
View
ACL
1998
15 years 8 months ago
Eliminative Parsing with Graded Constraints
Abstract Resource adaptlvity" Because the sets of strucNatural language parsing is conceived to be a procedure of disambiguation, which successively reduces an initially total...
Johannes Heinecke, Jürgen Kunze, Wolfgang Men...
COLING
1996
15 years 8 months ago
On Inference-Based Procedures for Lexical Disambiguation
In this paper we sketch a decidable inference-based procedure for lexical disambiguation which operates on semantic representations of discourse and conceptual knowledge, In contr...
Jürgen Wedekind
AMAI
2006
Springer
15 years 6 months ago
Answer set based design of knowledge systems
The aim of this paper is to demonstrate that A-Prolog is a powerful language for the construction of reasoning systems. In fact, A-Prolog allows to specify the initial situation, t...
Marcello Balduccini, Michael Gelfond, Monica Nogue...
ENTCS
2008
91views more  ENTCS 2008»
15 years 6 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
TRS
2008
15 years 6 months ago
Generalized Indiscernibility Relations: Applications for Missing Values and Analysis of Structural Objects
In this paper, we discuss an approach to structural objects based on a generalisation of indiscernibility relation used in rough set theory. The existing results in rough set theor...
Wojciech Jaworski