Most of contemporary software systems are implemented using an object-oriented approach. Modeling phases – during which software engineers analyze requirements to the future system using some modeling language – are...
详细信息
We introduce a Three Tier Tree Calculus (T3C) that defines in a systematic way three tiers of tree structures underlying proof search in logic programming. We use T3C to define a new - structural - version of resoluti...
详细信息
We introduce a Three Tier Tree Calculus (T3C) that defines in a systematic way three tiers of tree structures underlying proof search in logic programming. We use T3C to define a new - structural - version of resolution for logic programming.
In this paper we study the semantics of Coinductive logic programming and clarify its intrinsic computational limits, which prevent, in particular, the definition of a complete, computable, operational semantics. We p...
详细信息
In this paper we study the semantics of Coinductive logic programming and clarify its intrinsic computational limits, which prevent, in particular, the definition of a complete, computable, operational semantics. We propose a new operational semantics that allows a simple correctness result and the definition of a simple meta-interpreter. We compare, and prove the equivalence, with the operational semantics defined and used in other papers on this topic.
logic for programming and Automated Reasoning : 6Th International Conference, Lpar'99, Tbilisi, Georgia, September 6-10, 1999 : Proceedings by Lpar '99 (1999 : Tʻbilisi, Georgia); Ganzinger, H. (Harald), 1950-...
详细信息
logic for programming and Automated Reasoning : 6Th International Conference, Lpar'99, Tbilisi, Georgia, September 6-10, 1999 : Proceedings by Lpar '99 (1999 : Tʻbilisi, Georgia); Ganzinger, H. (Harald), 1950-; McAllester, David A; Voronkov, A. (Andreĭ), 1959-; published by Berlin ; New York : Springer
We develop formal foundations for notions and mechanisms needed to support service-oriented computing. Our work builds on recent theoretical advancements in the algebraic structures that capture the way services are o...
详细信息
We develop formal foundations for notions and mechanisms needed to support service-oriented computing. Our work builds on recent theoretical advancements in the algebraic structures that capture the way services are orchestrated and in the processes that formalize the discovery and binding of services to given client applications by means of logical representations of required and provided services. We show how the denotational and the operational semantics specific to conventional logic programming can be generalized using the theory of institutions to address both static and dynamic aspects of service-oriented computing. Our results rely upon a strong analogy between the discovery of a service that can be bound to an application and the search for a clause that can be used for computing an answer to a query;they explore the manner in which requests for external services can be described as service queries, and explain how the computation of their answers can be performed through service-oriented derivatives of unification and resolution, which characterize the binding of services and the reconfiguration of applications.
During the last two decades, several fuzzy extensions of the pure logic language Prolog have been developed thus producing modern fuzzy logic languages which manage truth degrees beyond the simpler case of true, false...
详细信息
ISBN:
(纸本)9781479975617
During the last two decades, several fuzzy extensions of the pure logic language Prolog have been developed thus producing modern fuzzy logic languages which manage truth degrees beyond the simpler case of true, false. Such values are usually collected in lattices whose correct design require to take special care when deciding the top/bottom elements, establishing the ordering relation and so on. In this paper we describe a graphical tool devoted to assist the development of such structures. A crucial and distinguishing feature of the tool relies on its capability for generating code in form of Prolog clauses which can be directly imported by the fuzzy logic programming environment FLOPER developed too in our research group.
For collaborative learning to be successful, the instructor must carefully plan the formation of student groups. Typically, a teacher uses a set of conditions inferred from certain student parameters such as individua...
详细信息
For collaborative learning to be successful, the instructor must carefully plan the formation of student groups. Typically, a teacher uses a set of conditions inferred from certain student parameters such as individual proficiency, learning and thinking styles, team-related traits and personality traits. While all of these parameters are instructor-driven, it is also favorable to get the teammate preferences of the students. Based on this, an instructor strategy can thus be generalized as an assignment problem that satisfies the most number of predetermined conditions based on these parameters and the most number of teammate preferences. In this paper, the generic model was implemented using constraint logic programming. Cohorts produced are evaluated based on the parameter constraints satisfied and on the number of teammate preferences satisfied. As such, the study demonstrates not only the feasibility of applying Constraint logic programming in the field of computer-supported group formation but also demonstrates that an instructor strategy can both include parameters decided by the instructor and teammate preferences from students.
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...
详细信息
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.
The problem of detecting objects and their movements in sensor data is of crucial importance in providing safe navigation through both indoor and outdoor environments for the visually impaired. In our setting we use d...
详细信息
The problem of detecting objects and their movements in sensor data is of crucial importance in providing safe navigation through both indoor and outdoor environments for the visually impaired. In our setting we use depth-sensor data obtained from a simulator and use inductive logic programming (ILP), a subfield of machine learning that deals with learning concept descriptions, to learn how to detect borders, find the border that is nearest to some point of interest, and border correspondence through time. We demonstrate how ILP can be used to tackle this problem in an incremental manner by using previously learned predicates to construct more complex ones. The learned concept descriptions show high (> 90%) accuracy and their natural language interpretation closely matches an intuitive understanding of their meaning.
暂无评论