We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
In this paper we present a proposal for representing soft constraint satisfaction problems (CSPs) within the Semantic Web architecture. The proposal is motivated by the need for a...
Alun D. Preece, Stuart Chalmers, Craig McKenzie, J...
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
The World-Wide Web was originally developed as a shared, writable, hypertext medium, a facility that is still widely needed. We have recently developed a Web-based management repo...
Timothy Miles-Board, Les Carr, Simon Kampa, Wendy ...