We present an extension of constraint logic programming, where the admissible constraints are arbitrary first-order formulas over various domains: real numbers with ordering, linear constraints over p-adic numbers, co...
详细信息
ISBN:
(纸本)3540289666
We present an extension of constraint logic programming, where the admissible constraints are arbitrary first-order formulas over various domains: real numbers with ordering, linear constraints over p-adic numbers, complex numbers, linear constraints over the integers with ordering and congruences (parametric Presburger Arithmetic), quantified propositional calculus (parametric QSAT), term algebras. Our arithmetic is always exact. For R are C there are no restrictions on the polynomial degree of admissible constraints. Constraint solving is realized by effective quantifier elimination. We have implemented our methods in our system CLP(RL). A number of computation examples with CLP(RL) are given in order to illustrate the conceptual generalizations provided by our approach and to demonstrate its feasibility.
Albeit temporal reasoning and modularity are very prolific fields of research in logic programming (LP), we find few examples of their integration. In this paper we propose the addition of temporal annotations to a mo...
详细信息
ISBN:
(纸本)9780769528366
Albeit temporal reasoning and modularity are very prolific fields of research in logic programming (LP), we find few examples of their integration. In this paper we propose the addition of temporal annotations to a modular extension of LP Moreover we also provide a sketch for a compiler allowing this way for the development of applications based on such language.
This paper presents an Arabic Morphological Analyzer and its implementation in clp(FD), a constraint logic programming language. The Morphological Analyzer (MA) represents a component of an architecture which can proc...
详细信息
ISBN:
(纸本)3540408037
This paper presents an Arabic Morphological Analyzer and its implementation in clp(FD), a constraint logic programming language. The Morphological Analyzer (MA) represents a component of an architecture which can process unrestricted text from a source such as Internet. The morphological analyzer uses a constraint-based model to represent the morphological rules for verbs and nouns, a matching algorithm to isolate the affixes and the root of a given word-form, and a linguistic knowledge base consisting in lists of markers. The morphological rules fall into two categories: the regular morphological rules of the Arabic grammar and the exception rules that represent the language exceptions. clp(FD) is particularly suitable for the implementation of our system thanks to its double reasoning: symbolic reasoning expresses the logic properties of the problem and facilitates the implementation of a the linguistic knowledge base, and heuristics, while constraint satisfaction reasoning on finite domains uses constraint propagation to keep the search space manageable.
logic programming (LP) is an essential part of many academic curricula and it is extensively employed in the field of Artificial Intelligence. However, being based on a fundamentally different paradigm and lacking any...
详细信息
ISBN:
(纸本)9781479940387
logic programming (LP) is an essential part of many academic curricula and it is extensively employed in the field of Artificial Intelligence. However, being based on a fundamentally different paradigm and lacking any visual tools for inexperienced users, its teaching may lead to confusion and low student motivation. Virtual Worlds (VWs) may help overcome these obstacles, as they have been successfully used in computer programming education. In this paper we present the MeLoISE platform (Meaningful logical Interpretations of Simulated Environments) for teaching LP in VWs, through which students can experience a collaborative visual interface to the Prolog programming language. We also present an evaluation of MeLoISE, which was conducted during a learning activity that engaged students in collaborative programming for 2 problem scenarios. Students performed very well and were enthusiastic with the new environment.
The paper describes an interplay between numerical and qualitative models represented in a uniform Constraint logic programming framework. In the context of model-based diagnosis a detailed, numerical model is used to...
详细信息
ISBN:
(纸本)0262691477
The paper describes an interplay between numerical and qualitative models represented in a uniform Constraint logic programming framework. In the context of model-based diagnosis a detailed, numerical model is used to discriminate between competing diagnoses at the abstract, qualitative level. A distinguishing feature of our approach is that the abstract proof is used to guide the verification at the detailed level, and to refute impossible refinements as soon as possible by introducing additional constraints on the variables. An implemented instance of this framework, CLP(R), which is used in the paper, comprises a solver for systems of linear equations and inequalities over real-valued variables.
Reasoning about actions and changes often starts with an action theory which is then used for planning, prediction or explanation. In practice it is sometimes not simple to give an immediately available action theory....
详细信息
ISBN:
(纸本)3540649581
Reasoning about actions and changes often starts with an action theory which is then used for planning, prediction or explanation. In practice it is sometimes not simple to give an immediately available action theory. In this paper we will present an abductive methodology for describing action domains. We start with an action theory which is not complete, i.e., has more than one model. Then, after some tests are done, we can abduce a complete action theory. Technically, we use a high level action language to describe incomplete domains and tests. Then, we present a translation from domain descriptions to abductive logic programs. Using tests, we then abductively refine an original domain description to a new one which is closer to the domain in reality. The translation has been shown to be both sound and complete. The result of this paper can be used not only for refinement of domain descriptions but also for abductive planning, prediction and explanation. The methodology presented in this paper has been implemented by an abductive logic programming system.
We extend logic programming's semantics with the semantic dual of traditional Herbrand semantics by using greatest fixed-points in place of least fixed-points. Executing a logic program then involves using coinduc...
详细信息
ISBN:
(纸本)3540366350
We extend logic programming's semantics with the semantic dual of traditional Herbrand semantics by using greatest fixed-points in place of least fixed-points. Executing a logic program then involves using coinduction to check inclusion in the greatest fixed-point. The resulting coinductive logic programming language is syntactically identical to, yet semantically subsumes logic programming with rational terms and lazy evaluation. We present a novel formal operational semantics that is based on synthesizing a coinductive hypothesis for this coinductive logic programming language. We prove that this new operational semantics is equivalent to the declarative semantics. Our operational semantics lends itself to an elegant and efficient goal directed proof search in the presence of rational terms and proofs. We describe a prototype implementation of this operational semantics along with applications of coinductive logic programming.
In an agent system that needs to operate in a real world, the problem of maintaining a consistent world model in the face of unreliable, incomplete and inconsistent sensory data should be solved. In this paper, we pre...
详细信息
ISBN:
(纸本)9781467375092
In an agent system that needs to operate in a real world, the problem of maintaining a consistent world model in the face of unreliable, incomplete and inconsistent sensory data should be solved. In this paper, we present an approach that addresses this problem by applying an argumentation-based scene interpretation framework for accurately modelling and representing the observations and beliefs of an agent. Our approach is based on temporal and probabilistic defeasible logic programming for reasoning. The performance of our approach is evaluated on simulation experiments in the Stage Robot Simulator. We also show that our approach is applicable to real world scenarios with an autonomous Pioneer 3-AT robot.
This paper introduces Compositional Neural logic programming (CNLP), a framework that integrates neural networks and logic programming for symbolic and sub-symbolic reasoning. We adopt the idea of compositional neural...
详细信息
ISBN:
(纸本)9780999241196
This paper introduces Compositional Neural logic programming (CNLP), a framework that integrates neural networks and logic programming for symbolic and sub-symbolic reasoning. We adopt the idea of compositional neural networks to represent first-order logic predicates and rules. A voting backward-forward chaining algorithm is proposed for inference with both symbolic and sub-symbolic variables in an argument-retrieval style. The framework is highly flexible in that it can be constructed incrementally with new knowledge, and it also supports batch reasoning in certain cases. In the experiments, we demonstrate the advantages of CNLP in discriminative tasks and generative tasks.
Decision making models for autonomous agents have received increased attention, particularly in the field of intelligent robots. In this paper we will show how a Defeasible logic programming approach with an underlyin...
详细信息
ISBN:
(纸本)9783540721994
Decision making models for autonomous agents have received increased attention, particularly in the field of intelligent robots. In this paper we will show how a Defeasible logic programming approach with an underlying argumentation based semantics, could be applied in a robotic domain for knowledge representation and reasoning about which task to perform next. At this end, we have selected a simple application domain, consisting of a micro-world environment using real and simulated robots for cleaning tasks.
暂无评论