We introduce the consistent topological structure and neighborhood structure into the logical framework for providing the logical foundation and logical normalization for the approximate reasoning. We present the conc...
详细信息
Programs typically spend much of their execution time in loops. This makes the generation of efficient code for loops essential for good performance. Loop optimization of logic programming languages is complicated by ...
详细信息
In this paper we present a new method for reasoning abductively over instances of a triples ontology. We compute the usefulness of evidence toward making an inference rather than its truth value, probabilistic or othe...
详细信息
The problem of expressing and supporting classical greedy algorithms in Datalog has been the focus of many significant research efforts that have produced very interesting solutions for particular algorithms. But we s...
详细信息
The problem of expressing and supporting classical greedy algorithms in Datalog has been the focus of many significant research efforts that have produced very interesting solutions for particular algorithms. But we still lack a general treatment that characterizes the relationship of greedy algorithms to non-monotonic theories and leads to asymptotically optimal implementations. In this paper, we propose a general solution to this problem. Our approach begins by identifying a class of locally stratified programs that subsumes XY-stratified programs and is formally characterized using the Datalogis representation of numbers. Then, we propose a simple specialization of the iterated fixpoint procedure that computes efficiently the perfect model for these programs, achieving optimal asymptotic complexities for well-known greedy algorithms. This makes possible their efficient support in Datalog systems.
We present relational interpreters for several subsets of Scheme, written in the pure logic programming language miniKanren. We demonstrate these interpreters running "backwards" - that is, generating progra...
详细信息
We introduce a sufficient condition which guarantees the existence of stable models for a normal residuated logic program interpreted on the truth-space [0, 1]n. Specifically, the continuity of the connectives involve...
详细信息
In this extended abstract, we propose a rule-based formalization of eligibility criteria for clinical trials. The rule-based formalization is implemented by using the logic programming language Prolog. Compared with e...
详细信息
We prove that the second-order unification problem is undecidable even if the functional free variables may only be applied to ground terms. Despite this strong restriction our proof uses elementary techniques, and do...
详细信息
ISBN:
(纸本)9780897919791
We prove that the second-order unification problem is undecidable even if the functional free variables may only be applied to ground terms. Despite this strong restriction our proof uses elementary techniques, and does not rely on the undecidability of the tenth Hilbert's problem which itself has a very difficult proof. We apply this result to obtain a surprising result of the undecidability of type inference for the Church-style system F - polymorphic λ-calculus.
We present a framework that we are currently developing, that allows one to extract knowledge from natural language sentences using a deep analysis technique based on linguistic dependencies. The extracted knowledge i...
详细信息
We present a framework that we are currently developing, that allows one to extract knowledge from natural language sentences using a deep analysis technique based on linguistic dependencies. The extracted knowledge is represented in OOLOT, an intermediate format that we have introduced, inspired by the Language of Thought (LOT) and based on Answer Set programming (ASP). OOLOT uses an ontology-oriented lexicon and syntax. Therefore, it is possible to export the extracted knowledge into OWL and native ASP.
In this paper we report on the first attempts to customize and exploit in DLV, a state-of-the-art Answer Set programming system, both novel and existing parallelization methods for the propositional search phase. Phes...
详细信息
In this paper we report on the first attempts to customize and exploit in DLV, a state-of-the-art Answer Set programming system, both novel and existing parallelization methods for the propositional search phase. Phese techniques, combined with the recently proposed strategies for parallel instantiation, will pave the way for obtaining a fully parallel DLV system. Phe results of an experimental analysis are also reported, showing the impact of parallel techniques on the performance of the DLV system.
暂无评论