A Logic-Based Tool for Semantic Information Extraction

Ruffolo, Massimo; Manna, Marco; Gallucci, Lorenzo; Leone, Nicola; Saccà, Domenico

doi:10.1007/11853886_48

Cited by 9 publications

(11 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This ordering guarantees that a node A strictly precedes a node B if the program module corresponding to A has to be evaluated before the one corresponding to B. 1 We are now ready to describe the parallel instantiation procedures exploiting this ordering. As previously pointed out, we make use of some threads: a manager, and a number of instantiators running the procedures M anager and Instantiator reported in Figure 4, respectively.…”

Section: The Parallel Instantiation Proceduresmentioning

confidence: 99%

“…First of all, the sets T, I, and Π are initialized like in the standard DLV Instantiator. Moreover, three new sets of components are created: U (which stands for Undone) represents the components of P that have still to be 1 Note that the presence of negative arcs in G c P only determines a preference among the admissible orderings induced by the dependency graph, thus it does not affect the correctness of the overall instantiation process. processed, D (which stands for Done) those that have already been instantiated, and R (which stands for Running) those currently being processed.…”

Section: The Parallel Instantiation Proceduresmentioning

confidence: 99%

“…Indeed, the recent applications of ASP in different emerging areas, such as knowledge management or information extraction/integration [1][2][3], have evidenced the practical need of more performant and scalable ASP systems.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Experimenting with parallelism for the instantiation of ASP programs

Calimeri

Perri

Ricca

2008

Journal of Algorithms

View full text Add to dashboard Cite

Section: The Parallel Instantiation Proceduresmentioning

confidence: 99%

Section: The Parallel Instantiation Proceduresmentioning

confidence: 99%

See 1 more Smart Citation

Experimenting with parallelism for the instantiation of ASP programs

Calimeri

Perri

Ricca

2008

Journal of Algorithms

View full text Add to dashboard Cite

“…HiLeX [10] supports a semantic-aware approach to information extraction from unstructured data (i.e., documents in several formats, e.g., html, txt, doc, pdf, etc). In HiLeX information extraction is "Ontology driven", and exploits a domain description expressed through an OntoDLP ontology.…”

Section: Industry-level Applications and Commercementioning

confidence: 99%

The DLV Project: A Tour from Theory and Research to Applications and Market

Leone

Faber

2008

Logic Programming

Self Cite

View full text Add to dashboard Cite

Abstract. DLV is one of the most succesful and widely used ASP systems. It is based on stable model semantics, and supports a powerful language extending Disjunctive Logic Programming with many expressive constructs, including aggregates, strong and weak constraints, functions, lists, and sets. In this paper, we describe the long tour from basic research on languages and semantics, studies on algorithms and complexity, design and implementation of prototypes, up to the realization of a powerful and efficient system, which won the last ASP competition, is employed in industrial applications, and is even ready for marketing and commercial distribution. We report on the experience we got in more than twelve years of work in the DLV project, focusing on most recent developments, industrial applications, trends, and market perspectives.

show abstract

“…OntoDLV [35,36], OLEX [11,39], HıLεX [38,37], are three Knowledge Management products of EXEURA based on DLV.…”

Section: Spin-off and Applicationsmentioning

confidence: 99%

The Disjunctive Datalog System DLV

et al. 2011

Self Cite

View full text Add to dashboard Cite

Abstract. DLV is one of the most successful and widely used answer set programming (ASP) systems. It supports a powerful language extending Disjunctive Datalog with many expressive constructs, including aggregates, strong and weak constraints, functions, lists, and sets. The system provides database connectivity offering a simple way for powerful reasoning on top of relational databases. In this paper, we provide an ample overview of the DLV system. We illustrate its input language and give indications on how to use it for representing knowledge. We also provide a panorama on the system architecture and the main optimizations it incorporates. We then focus on DLV DB , an extension of the basic system which allows for tight coupling with traditional database systems. Finally, we report on a number industrial applications which rely on DLV.

show abstract

A Logic-Based Tool for Semantic Information Extraction

Cited by 9 publications

References 6 publications

Experimenting with parallelism for the instantiation of ASP programs

Experimenting with parallelism for the instantiation of ASP programs

The DLV Project: A Tour from Theory and Research to Applications and Market

The Disjunctive Datalog System DLV

Contact Info

Product

Resources

About