One first defines the triangles of a lattice T, that is, the lattices Delta(s)(T) of all decreasing sequences of s elements of T, and study some basic properties (modularity, distributivity, boundedness, atomisticity,...
详细信息
ISBN:
(纸本)0769523366
One first defines the triangles of a lattice T, that is, the lattices Delta(s)(T) of all decreasing sequences of s elements of T, and study some basic properties (modularity, distributivity, boundedness, atomisticity, inf-pseudo complementation, monotonic representations) of Delta(s)(T). An important result is : If T is a boolean algebra, then Delta S(T) is a Post algebra (of order (s+1));one specially discusses the case when T is the powerset P(Omega) : Delta(s)(T) is then isomorphic to the postian lattice Ps+1(Omega) of the (s+1)-ordered partitions of Omega which is a multivalued genereralization of the powerset. Afterwards, one studies some cases where T is, in turn, a Post algebra, specially T = P-r(Omega)). One then exhibits some typical finite distributive lattices called leibnizians, denoted < r + s(s) - 1 > and also defines, with the help of triangulation, the lattices P-s,P-r(Omega) which arle called the postians of type (s,r) of a set Omega. Actually both structures (leibnizians as well as postians) turn out to be important algebraic concretisations of Post multivalued logical conceptions.
The paper presents DLV(+)a Disjunctive logic programming system with object-oriented constructs, including classes, objects, (multiple) inheritance, and types. DLV+ is built on top of DLV (a state-of-the art DLP syste...
详细信息
ISBN:
(纸本)3540285385
The paper presents DLV(+)a Disjunctive logic programming system with object-oriented constructs, including classes, objects, (multiple) inheritance, and types. DLV+ is built on top of DLV (a state-of-the art DLP system), and provides a graphical user interface that allows to specify, update, browse, query, and reason on knowledge bases. Two strong points of the system are the powerful type-checking mechanism, and the advanced interface for visual querying.
We propose a characterization of provability in Bl's Pointer logic (PL) that is based on semantic structures called resource graphs. This logic has been defined for reasoning about mutable data structures and resu...
详细信息
ISBN:
(纸本)354030553X
We propose a characterization of provability in Bl's Pointer logic (PL) that is based on semantic structures called resource graphs. This logic has been defined for reasoning about mutable data structures and results about models and verification have been already provided. Here, we define resource graphs that capture PL models by considering heaps as resources and by using a labelling process. We study provability in PL from a new calculus that builds such graphs from which proofs or countermodels can be generated. Properties of soundness and completeness are proved and the countermodel generation is studied.
In this paper we present a methodology to estimate rates of enzymatic reactions in metabolic pathways. Our methodology is based on applying stochastic logic learning in ensemble learning. Stochastic logic programs pro...
详细信息
ISBN:
(纸本)3540253750
In this paper we present a methodology to estimate rates of enzymatic reactions in metabolic pathways. Our methodology is based on applying stochastic logic learning in ensemble learning. Stochastic logic programs provide an efficient representation for metabolic pathways and ensemble methods give state-of-the-art performance and are useful for drawing biological inferences. We construct ensembles by manipulating the data and driving randomness into a learning algorithm. We applied failure adjusted maximization as a base learning algorithm. The proposed ensemble methods are applied to estimate the rate of reactions in metabolic pathways of Saccharomyces cerevisiae. The results show that our methodology is very useful and it is effective to apply SLPs-based ensembles for complex tasks such as modelling of metabolic pathways.
This paper follows the research direction that has received a growing interest recently, namely application of knowledge discovery methods to complex data representations. Among others, there have been methods propose...
详细信息
ISBN:
(纸本)354029922X
This paper follows the research direction that has received a growing interest recently, namely application of knowledge discovery methods to complex data representations. Among others, there have been methods proposed for learning in expressive, hybrid languages, combining relational component with terminological (description logics) component. In this paper we present a novel approach to frequent pattern discovery over the knowledge base represented in such a language, the combination of the basic subset of description logics with DL-safe rules, that can be seen as a subset of Semantic Web Rule Language. Frequent patterns in our approach are represented as conjunctive DL-safe queries over the hybrid knowledge base. We present also an illustrative example of our method based on the financial dataset.
This paper presents the pertinence of the use of the Answer Set programming (ASP) formalism for developing a computational model of a software agent for Computer Supported Collaborative Learning (CSCL) environments. T...
详细信息
ISBN:
(纸本)3540298967
This paper presents the pertinence of the use of the Answer Set programming (ASP) formalism for developing a computational model of a software agent for Computer Supported Collaborative Learning (CSCL) environments. This analytic model is based on a representation of for agent's beliefs about the learner and the domain, together with the corresponding inference system with the appropriate rules to derive new beliefs about the capabilities of the learner, and its use in order to support effective collaboration and maintain learning possibilities for the group members. The model provides a representation of the structural knowledge frontier and the social knowledge frontier of the learner, which are the components for the definition of the learner's zone of proximal development (zpd). Based on the zpd of its learner the agent can propose her a learning task and maintain the zpd for the learner in the group. The complete code of the model is presented in the declarative language of DLV, a logic programming language for implementing ASP models.
Deontic logic is appropriate to model a wide variety of legal arguments, however this logic suffers from certain paradoxes of which the so-called Chisholm paradox is one of the most notorious. We propose a formalisati...
详细信息
ISBN:
(纸本)3540258787
Deontic logic is appropriate to model a wide variety of legal arguments, however this logic suffers from certain paradoxes of which the so-called Chisholm paradox is one of the most notorious. We propose a formalisation of the Chisholm set in the framework of the situation calculus. We utilise this alternative to modal logic for formalising the obligations of the agent and avoiding the Chisholm paradox. This new approach makes use of the notion of obligation fluents together with their associated successor state axioms. Furthermore, some results about automated reasoning in the situation calculus can be applied in order to consider a tractable implementation.
Abadi-Leino logic is a Hoare-calculus style logic for a simple imperative and object-based language where every object comes with its own method suite. Consequently, methods need to reside in the store ("higher-o...
详细信息
ISBN:
(纸本)3540254358
Abadi-Leino logic is a Hoare-calculus style logic for a simple imperative and object-based language where every object comes with its own method suite. Consequently, methods need to reside in the store ("higher-order store"). We present a new soundness proof for this logic using a denotational semantics where object specifications are recursive predicates on the domain of objects. Our semantics reveals which of the limitations of Abadi and Leino's logic are deliberate design decisions and which follow from the use of higher-order store. We discuss the implications for the development of other, more expressive, program logics.
PROB is a model checking tool for the B Method. In this paper we present an extension of PRoB that supports checking of specifications written in a combination of CSP and B. We explain how the notations are combined s...
详细信息
ISBN:
(纸本)3540278826
PROB is a model checking tool for the B Method. In this paper we present an extension of PRoB that supports checking of specifications written in a combination of CSP and B. We explain how the notations are combined semantically and give an overview of the implementation of the combination. We illustrate the benefit that appropriate use of CSP, in conjunction with our tool, gives to B developments both for specification and for verification purposes.
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most one answer and that answer is generate...
详细信息
ISBN:
(纸本)3540254358
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most one answer and that answer is generated only once. The principal component of the technique is a goal-independent analysis of individual clauses. This derives a condition for a call that ensures only one clause in the matching predicate possesses a successful derivation. Another key component of the analysis is backwards reasoning stage that strengthens these conditions to derive properties on a call that assure determinacy. The analysis has applications in program development, implementation and specialisation.
暂无评论