In an organisation any optimization process of its issues faces increasing challenges and requires new approaches to the organizational phenomenon. Indeed, in this work it is addressed the problematic of efficiency dy...
详细信息
ISBN:
(纸本)9783319480572;9783319480565
In an organisation any optimization process of its issues faces increasing challenges and requires new approaches to the organizational phenomenon. Indeed, in this work it is addressed the problematic of efficiency dynamics through intangible variables that may support a different view of the corporations. It focuses on the challenges that information management and the incorporation of context brings to competitiveness. Thus, in this work it is presented the analysis and development of an intelligent decision support system in terms of a formal agenda built on a logicprogramming based methodology to problem solving, complemented with an attitude to computing grounded on Artificial Neural Networks. The proposed model is in itself fairly precise, with an overall accuracy, sensitivity and specificity with values higher than 90 %. The proposed solution is indeed unique, catering for the explicit treatment of incomplete, unknown, or even self-contradictory information, either in a quantitative or qualitative arrangement.
In this work we present a backjumping technique for Disjunctive logicprogramming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been proposed for propositional satisfiabil...
详细信息
In this work we present a backjumping technique for Disjunctive logicprogramming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been proposed for propositional satisfiability testing, which have been adapted to non-disjunctive Answer Set programming (ASP) recently [1,2]. We focus on backjumping without clause learning. We provide a new theoretical framework for backjumping on Disjunctive logic Programs. We optimize the reason calculus, reducing the information to be stored, while fully preserving the correctness and the efficiency of the jumping technique. We implement the proposed technique in DLV, the state-of-the-art DLP system. We have conducted several experiments on hard random problems in order to assess the impact of backjumping. Our conclusion is that when lookahead is employed, there is basically no advantage when enabling backjumping. However, when lookahead is disabled, we can observe that the number of choices in general decreases by a non-negligible factor. In our (naive) implementation this gain is (often more than) compensated by the additional overhead incurred by the reason calculus. It is unclear whether one can reduce this overhead by a more efficient implementation. We therefore conjecture that, at least on hard unstructured instances, backjumping only has an impact when lookahead is not active and when clause learning is employed in addition.
The PARMC system performs modelc hecking for systems described in the XL language, a variant of CCS. Extending previous work by Dong and Ramakrishnan that compiled XL specifications into an optimized transition relati...
详细信息
The commonly recognised weakness of modern object-oriented design and implementation methodologies lies in their superficial treatment of inter-object dynamics. This paper addresses the problem of behaviour modelling ...
详细信息
ISBN:
(纸本)0818680474
The commonly recognised weakness of modern object-oriented design and implementation methodologies lies in their superficial treatment of inter-object dynamics. This paper addresses the problem of behaviour modelling by suggesting utilisation of the concept of high-level Petri nets to model object interactions. The Petri net representation creates an additional access layer of object architecture, providing a meta-level object control with the sequencing of method execution. It is argued that the two layer object view presented allows one, both mathematically and pragmatically, to achieve a more precise and flexible description of inter-object dynamics. The usefulness of the approach is demonstrated by some illustrative examples.
In the logicprogramming community, the concept of interargument relation, that is, the relation that holds between the size of the arguments of a procedure, appears in numerous works on termination proofs for logic p...
详细信息
Intensional sets are sets given by a property rather than by enumerating their elements, similar to set comprehensions available in specification languages such as B and MiniZinc. In a previous paper [3] we have prese...
详细信息
According to the characteristics of WEB management information system, a reasonable division has been made between the representation layer and the business layer to further define the relation of permission-page and ...
详细信息
In proof planning mathematical objects with theory-specific properties have to be constructed. More often than not, mere unification offers little support for this task. However, the integration of constraint solvers ...
详细信息
ISBN:
(纸本)3540672818
In proof planning mathematical objects with theory-specific properties have to be constructed. More often than not, mere unification offers little support for this task. However, the integration of constraint solvers into proof planning can sometimes help solving this problem. We present such an integration and discover certain requirements to be met in order to integrate the constraint solver's efficient activities in a way that is correct and sufficient for proof planning. We explain how the requirements can be met by n extension of the constraint solving technology and describe their implementation in the constraint solver CoSIE.
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of Curry, is obtained by transforming C...
详细信息
ISBN:
(纸本)3540672818
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of Curry, is obtained by transforming Curry programs into Prolog programs:. Contrary to previous transformations of functional logic programs into Prolog, our implementation includes new mechanisms for both efficiently performing concurrent evaluation steps and sharing common subterms. The practical results show that our implementation is superior to previously proposed similar implementations of functional logic languages in Prolog and is competitive w.r.t. lower-level implementations of Curry in other target languages. An noteworthy advantage of our implementation is the ability to immediately employ in Curry existing constraint solvers for logicprogramming. In this way, we obtain with a relatively modest effort the implementation of a declarative language combining lazy evaluation, concurrency and constraint solving for a variety of constraint systems.
暂无评论