Constraint Logic Programming for Natural Language Processing

This paper proposes an evaluation of the adequacy of the constraint logic programming paradigm for natural language processing. Theoretical aspects of this question have been discussed in several works. We adopt here a pragmatic point of view and our argumentation relies on concrete solutions. Using actual contraints (in the CLP sense) is neither easy nor direct. However, CLP can improve parsing techniques in several aspects such as concision, control, efficiency or direct representation of linguistic formalism. This discussion is illustrated by several examples and the presentation of an HPSG parser.Comment: 15 pages, uuencoded and compressed postscript to appear in Proceedings of the 5th Int. Workshop on Natural Language Understanding and Logic Programming. Lisbon, Portugal. 199

Towards a generation-based semantic web authoring tool

Widespread use of Semantic Web technologies requires interfaces through which knowledge can be viewed and edited without deep understanding of Description Logic and formalisms like OWL and RDF. Several groups are pursuing approaches based on Controlled Natural Languages (CNLs), so that editing can be performed by typing in sentences which are automatically interpreted as statements in OWL. We suggest here a variant of this approach which relies entirely on Natural Language Generation (NLG), and propose requirements for a system that can reliably generate transparent realisations of statements in Description Logic

A meta-interpreter based on paraconsistent legal knowledge engineering

The Legal Knowledge Engineering is a new topic of investigation of Artificial Intelligence. This paper discusses some relevant problems related to this new area in a summarized way. Within the Normative Law Theory, one question that arises naturally is that of contradiction, like for example: articles conflicting with other articles inside the same code, codes conflicting with codes, codes conflicting with jurisprudence, and in general, treatments with conflicting propositions in Normative Law Theory. This paper suggests to treat directly inconsistencies in the Legal Knowledge Engineering; this engineering has as underlying logic a paraconsistent annotated deontic logic. There are three main approximations in Legal Knowledge Engineering based on: cases, rules and logic. In this paper, we consider the approximation based on logic. It is considered a paraconsistent annotated deontic logic. Based on this logic, it is established a new proposal that is called Paraconsistent Legal Knowledge Engineering. For this proposal, it it is suggested a meta-interpreter to support the deontic operators as well as inconsistency — entitled on this paper Paralog D that can be used as a base to handle with the issues discussed