Query Answering in Belief Logic Programming

2009 ◽  
pp. 268-281 ◽  
Author(s):  
Hui Wan ◽  
Michael Kifer
Keyword(s):  
Logic Programming ◽  
Query Answering ◽  
Belief Logic

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