31 research outputs found
A general implementation framework for tabled CLP
This paper describes a framework to combine tabling evalua- tion and constraint logic programming (TCLP). While this combination has been studied previously from a theoretical point of view and some implementations exist, they either suffer from a lack of efficiency, flex- ibility, or generality, or have inherent limitations with respect to the programs they can execute to completion (either with success or fail- ure). Our framework addresses these issues directly, including the ability to check for answer / call entailment, which allows it to terminate in more cases than other approaches. The proposed framework is experimentally compared with existing solutions in order to provide evidence of the mentioned advantages
Tabled CLP for Reasoning Over Stream Data
The interest in reasoning over stream data is growing as quickly as the amount of data generated. Our intention is to change the way stream data is analyzed. This is an important problem because we constantly have new sensors collecting information, new events from electronic devices and/or from customers and we want to reason about this information. For example, information about traffic jams and costumer order could be used to define a deliverer route. When there is a new order or a new traffic jam, we usually restart from scratch in order to recompute the route. However, if we have several deliveries and we analyze the information from thousands of sensors, we would like to reduce the computation requirements, e.g. reusing results from the previous computation. Nowadays, most of the applications that analyze stream data are specialized for specific problems (using complex algorithms and heuristics) and combine a computation language with a query language. As a result, when the problems become more complex (in e.g. reasoning requirements), in order to modify the application complex and error prone coding is required.
We propose a framework based on a high-level language rooted in logic and constraints that will be able to provide customized services to different problems. The framework will discard wrong solutions in early stages and will reuse previous results that are still consistent with the current data set. The use of a constraint logic programming language will make it easier to translate the problem requirements into the code and will minimize the amount of re-engineering needed to comply with the requirements when they change
Negative non-ground queries in well founded semantics
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Computational LogicThe existing implementations of Well Founded Semantics restrict or forbid the use of
variables when using negative queries, something which is essential for using logic
programming as a programming language.
We present a procedure to obtain results under the Well Founded Semantics that
removes this constraint by combining two techniques: the transformation presented
in [MMNMH08] to obtain from a program its dual and the derivation procedure presented
in [PAP+91] to determine if a query belongs or not to the Well Founded Model
of a program.
Some problems arise during their combination, mainly due to the original environment
for which each one was designed: results obtained in the first one obey a
variant of Kunen Semantics and non-ground programs are not allowed (or previously
grounded) in the second one.
Most of these problems were solved by using abductive techniques, which lead
us to observe that the existing implementations of abduction in logic programming
disallow the use of variables.
The reason for that is the impossibility to evaluate non-ground queries, so it
seemed interesting to develop an abductive framework making use of our negation
system.
Both goals are achieved in this thesis: the capability of solving non-ground queries
under Well Founded Semantics and the use of variables in abductive logic programming
Tabling with Support for Relational Features in a Deductive Database
Tabling has been acknowledged as a useful technique in the logic programming arena for enhancing both performance and declarative properties of programs. As well, deductive database implementations benefit from this technique for implementing query solving engines. In this paper, we show how unusual operations in deductive systems can be integrated with tabling.Such operations come from relational database systems in the form of null-related (outer) joins, duplicate support and duplicate elimination. The proposal has been implemented as a proof of concept rather than an efficient system in the Datalog Educational System (DES) using Prolog as a development language and its dynamic database
Development of electrical resistivity imaging methods for geological and archaeological prospecting
Not availabl
Programming Languages and Systems
This open access book constitutes the proceedings of the 28th European Symposium on Programming, ESOP 2019, which took place in Prague, Czech Republic, in April 2019, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019