作者：
Lucas, Salvador
Universitat Politècnica de València Spain
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, g...
详细信息
the proceedings contain 15 papers. the special focus in this conference is on logic-Based Program Synthesis and Transformation. the topics include: Trace Analysis Using an Event-Driven Interval Temporal logic;the Prol...
ISBN:
(纸本)9783030452599
the proceedings contain 15 papers. the special focus in this conference is on logic-Based Program Synthesis and Transformation. the topics include: Trace Analysis Using an Event-Driven Interval Temporal logic;the Prolog Debugger and Declarative programming;a Port Graph Rewriting Approach to Relational Database Modelling;Generalization-Driven Semantic Clone Detection in CLP;semi-inversion of Conditional Constructor Term Rewriting Systems;a General Framework for Static Cost Analysis of Parallel logic Programs;incremental Analysis of logic Programs with Assertions and Open Predicates;computing Abstract Distances in logic Programs;synthesizing Imperative Code from Answer Set programming Specifications;verified Construction of Fair Voting Rules;solving Proximity Constraints;a Certified Functional Nominal C-Unification Algorithm;modeling and Reasoning in Event Calculus Using Goal-Directed Constraint Answer Set programming.
there is an increasing interest in using logicprogramming to specify and implement distributed algorithms, including a variety of network applications. these are applications where data and computation are distribute...
详细信息
there is an increasing interest in using logicprogramming to specify and implement distributed algorithms, including a variety of network applications. these are applications where data and computation are distributed among several devices and where, in principle, all the devices can exchange data and share the computational results of the group. In this paper we propose a declarative approach to distributed computing whereby distributed algorithms and communication models can be (i) specified as action theories of fluents and actions;(ii) executed as collections of distributed state machines, where devices are abstracted as (input/output) automata that can exchange messages;and (iii) analysed using existing results on connecting causal theories and Answer Set programming. Results on the application of our approach to different classes of network protocols are also presented.
In this paper we take on Stuart C. Shapiro's challenge of solving the Jobs Puzzle automatically and do this via controlled natural language processing. Instead of encoding the puzzle in a formal language that migh...
详细信息
In this paper we take on Stuart C. Shapiro's challenge of solving the Jobs Puzzle automatically and do this via controlled natural language processing. Instead of encoding the puzzle in a formal language that might be difficult to use and understand, we employ a controlled natural language as a high-level specification language that adheres closely to the original notation of the puzzle and allows us to reconstruct the puzzle in a machine-processable way and add missing and implicit information to the problem description. We show how the resulting specification can be translated into an answer set program and be processed by a state-of-the-art answer set solver to find the solutions to the puzzle.
Several extensions of the stable model semantics are available to describe "intensional" functions-functions that can be described in terms of other functions and predicates by logic programs. Such functions...
详细信息
Several extensions of the stable model semantics are available to describe "intensional" functions-functions that can be described in terms of other functions and predicates by logic programs. Such functions are useful for expressing inertia and default behaviors of systems, and can be exploited for alleviating the grounding bottleneck involving functional fluents. However, the extensions were defined in different ways under different intuitions. In this paper we provide several reformulations of the extensions, and note that they are in fact closely related to each other and coincide on large syntactic classes of logic programs.
We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method ...
详细信息
We present a new execution strategy for constraint logic programs called Failure Tabled CLP. Similarly to Tabled CLP our strategy records certain derivations in order to prune further derivations. However, our method only learns from failed derivations. this allows us to compute interpolants rather than constraint projection for generation of reuse conditions. As a result, our technique can be used where projection is too expensive or does not exist. Our experiments indicate that Failure Tabling can speed up the execution of programs with many redundant failed derivations as well as achieve termination in the presence of infinite executions.
Research on developing efficient and scalable ASP solvers can substantially benefit by the availability of data sets to experiment with. KB Bio 101 contains knowledge from a biology textbook, has been developed as par...
详细信息
Dealing with domains involving substantial quantitative information in Answer Set programming (ASP) often results in cumbersome and inefficient encodings. Hybrid "CASP" languages combining ASP and Constraint...
详细信息
Dealing with domains involving substantial quantitative information in Answer Set programming (ASP) often results in cumbersome and inefficient encodings. Hybrid "CASP" languages combining ASP and Constraint programming aim to overcome this limitation, but also impose inconvenient constraints - first and foremost that quantitative information must be encoded by means of total functions. this goes against central knowledge representation principles that contribute to the power of ASP, and makes the formalization of certain domains difficult. ASP{f} is being developed withthe ultimate goal of providing scientists and practitioners with an alternative to CASP languages that allows for the efficient representation of qualitative and quantitative information in ASP without restricting one's ability to deal with incompleteness or uncertainty. In this paper we present the latest outcome of such research: versions of the language and of the supporting system that allow for practical, industrial-size use and scalability. the applicability of ASP{f} is demonstrated by a case study on an actual industrial application.
the need to measure sequence similarity arises in many applicitation domains and often coincides with sequence alignment: the more similar two sequences are, the better they can be aligned. Aligning sequences not only...
详细信息
ISBN:
(纸本)9783540738466
the need to measure sequence similarity arises in many applicitation domains and often coincides with sequence alignment: the more similar two sequences are, the better they can be aligned. Aligning sequences not only shows how similar sequences are, it also shows where there are differences and correspondences between the sequences. Traditionally, the alignment has been considered for sequences of flat symbols only. Many real world sequences such as natural language sentences and protein secondary structures, however, exhibit rich internal structures. this is akin to the problem of dealing with structured examples studied in the field of inductivelogicprogramming (ILP). In this paper, we introduce REAL, which is a powerful, yet simple approach to align sequence of structured symbols using well-established ILP distance measures within traditional alignment methods. Although straight-forward, experiments on protein data and Medline abstracts show that this approach works well in practice, that the resulting alignments can indeed provide more information than flat ones, and that they are meaningful to experts when represented graphically.
Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we s...
详细信息
Maher (2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the defeasible logics in the DL framework are equally expressive under this formulation of relative expressiveness. the second formulation of relative expressiveness is stronger than the first. However, we show that logics incorporating individual defeat are equally expressive as the corresponding logics with team defeat. thus the only differences in expressiveness of logics in DL arise from differences in how ambiguity is handled. this completes the study of relative expressiveness in DL begun in Maher (2012).
暂无评论