Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
The use of topical features is abundant in Natural Language Processing (NLP), a major example being in dictionary-based Word Sense Disambiguation (WSD). Yet previous research does...
Natural language processing technology has developed remarkably, but it is still difficult for computers to understand contextual meanings as humans do. The purpose of our work ha...
Abstract. The Semantic Web is based on XML and RDF as its fundamental standards for exchanging and storing information on the World Wide Web. Event-condition-action (ECA) rules are...
Alexandra Poulovassilis, George Papamarkos, Peter ...