scholarly journals Towards Vague Query Answering in Logic Programming for Logic-Based Information Retrieval

2007 ◽  
pp. 125-134 ◽  
Author(s):  
Umberto Straccia
Keyword(s):  
Information Retrieval ◽  
Logic Programming ◽  
Query Answering

Complete Pattern Matching for DNA Computing

2006 ◽  
Vol 05 (04) ◽  
pp. 337-343
Author(s):  
Nadia Nedjah ◽  
Luiza De Macedo Mourelle
Keyword(s):  
Information Retrieval ◽  
Logic Programming ◽  
Pattern Matching ◽  
Theorem Proving ◽  
Dna Computing ◽  
Term Rewriting ◽  
Matching Method ◽  
Subject Term ◽  
Matching Technique ◽  
Complete Matching

Pattern matching is essential in many applications such as information retrieval, logic programming, theorem-proving, term rewriting and DNA-computing. It usually breaks down into two categories: root and complete pattern matching. Root matching determines whether a subject term is an instance of a pattern in a pattern set while complete matching determines whether a subject term contains a sub-term that is an instance of a pattern in a pattern set. For the sake of efficiency, root pattern matching need to be deterministic and lazy. Furthermore, complete pattern matching also needs to be parallel. Unlike root pattern matching, complete matching received little interest from the researchers of the field. In this paper, we present a novel deterministic multi-threaded complete matching method. This method subsumes a deterministic lazy root matching technique that was developped by the authors in an earlier work. We evaluate the performance of proposed method using theorem-proving and DNA-computing applications.

scholarly journals Proving Semantic Properties as First-Order Satisfiability (Extended Abstract)

2020 ◽  
Author(s):  
Salvador Lucas
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Answer Set Programming ◽  
Deductive Databases ◽  
Query Answering ◽  
Logical Theory ◽  
Data Bases ◽  
First Order ◽  
Computational Systems ◽  
Semantic Properties

The semantics of computational systems (e.g., relational and knowledge data bases, query-answering systems, programming languages, etc.) can often be expressed as (the specification of) a logical theory Th. Queries, goals, and claims about the behavior or features of the system can be expressed as formulas φ which should be checked with respect to the intended model of Th, which is often huge or even incomputable. In this paper we show how to prove such semantic properties φ of Th by just finding a model A of Th∪{φ}∪Zφ, where Zφ is an appropriate (possibly empty) theory depending on φ only. Applications to relational and deductive databases, rewriting-based systems, logic programming, and answer set programming are discussed.

A top-k query answering procedure for fuzzy logic programming

2012 ◽  
Vol 205 ◽  
pp. 1-29 ◽  
Author(s):  
Umberto Straccia ◽  
Nicolás Madrid
Keyword(s):  
Fuzzy Logic ◽  
Logic Programming ◽  
Query Answering
Sign in / Sign up

Export Citation Format

Share Document