Sciweavers

Share
ASP
2005
Springer
10 years 19 days ago
Exploiting ASP for Semantic Information Extraction
Abstract. The paper describes HıLεX, a new ASP-based system for the extraction of information from unstructured documents. Unlike previous systems, which are mainly syntactic, H...
Massimo Ruffolo, Nicola Leone, Marco Manna, Domeni...
ASP
2005
Springer
10 years 4 months ago
Combining Answer Sets of Nonmonotonic Logic Programs
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
Chiaki Sakama, Katsumi Inoue
ASP
2005
Springer
10 years 4 months ago
Nelson's Strong Negation, Safe Beliefs and the Answer Set Semantics
In this paper we consider an extension of the answer set semantics allowing arbitrary use of strong negation. We prove that the strong negation extension of any intermediate logic ...
Magdalena Ortiz, Mauricio Osorio
ASP
2005
Springer
10 years 4 months ago
Intelligence Analysis Using Quantitative Preferences
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
ASP
2005
Springer
10 years 4 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
ASP
2005
Springer
10 years 4 months ago
Extending Conceptual Logic Programs with Arbitrary Rules
We present extended conceptual logic programs (ECLPs), for which reasoning is decidable and, moreover, can be reduced to finite answer set programming. ECLPs are useful to reason ...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
ASP
2005
Springer
10 years 4 months ago
A New Algorithm for Answer Set Computation
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
Giuliano Grossi, Massimo Marchi
ASP
2005
Springer
10 years 4 months ago
An Experimental Study of Search Strategies and Heuristics in Answer Set Programming
Answer Set Programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called “tight”...
Enrico Giunchiglia, Marco Maratea
ASP
2005
Springer
10 years 4 months ago
Modeling Hybrid Domains Using Process Description Language
In previous work, action languages have predominantly been concerned with domains in which values are static unless changed by an action. Real domains, however, often contain value...
Sandeep Chintabathina, Michael Gelfond, Richard Wa...
ASP
2005
Springer
10 years 4 months ago
An Interactive Approach to Answer Set Programming
This paper outlines a novel approach to the computation of answer sets in an evolving and interactive environment. Instead of recomputing the semantics of the entire program, our a...
Martin Brain, Richard Watson, Marina De Vos
books