We present a position paper setting out the essentials of a new declarative framework named GBMF intended for modelling the higher-level aspects of business. It is based upon logic programming including, where appropr...
详细信息
We present a position paper setting out the essentials of a new declarative framework named GBMF intended for modelling the higher-level aspects of business. It is based upon logic programming including, where appropriate, finite-domain constraints. Business plans, processes, entity constraints, assets and business rules are representable in GBMF using an economical repertoire of primitive constructs and without requiring overly-burdensome programming effort. The framework, which has been fully implemented, has been applied so far to small-scale business exemplars. Our more general future aim, however, will be to demonstrate the framework's generic character by providing precise semantic mappings between it and other business modelling frameworks that rely upon specialized languages and engines.
We present StHorn, a novel technique for solving the satisfiability problem of CHCs, which works lazily and incrementally and is guided by the structure of the set of CHCs. Our technique is driven by the idea that a s...
详细信息
There are many benefits to incorporating In-System programming (ISP) in the development and production stages of new projects. Engineers are discovering that, like test, the features to support ISP must be designed in...
详细信息
There are many benefits to incorporating In-System programming (ISP) in the development and production stages of new projects. Engineers are discovering that, like test, the features to support ISP must be designed in to enable the full benefits of ISP. There are many issues that should be considered during the design stage. These include the tools to be used, the arrangement of the scan path, adequate power to support the programming operation, and many others. With proper attention to the initial design, ISP can save significant time-to-market and costs.
作者：
Plaza, Jan A.University of Miami
Department of Mathematics and Computer Science P.O. Box 249085 Coral GablesFL33124 United States
Whether logic programming is declarative depends on the technical condition of soundness and completeness: answers produced by resolution should be exactly the logical consequences of an easily understandable completi...
详细信息
We show that propositional logic and its extensions can support answer-set programming in the same way stable logic programming and disjunctive logic programming do. To this end, we introduce a logic based on the logi...
详细信息
Answer set programming (ASP) is a declarative programming paradigm that is geared towards difficult combinatorial search problems. Sometimes, run times of ASP systems suffer due to so called grounding bottleneck. Lazy...
详细信息
A novel approach to interactively acquire knowledge about new objects in a logic environment is presented. When the user supplies an unknown fact containing unknown objects (constants), the system will ask interesting...
详细信息
Prolog affords concise, elegant, and clean solutions for many interesting problems, but is not immune to the software engineering challenges of large-scale application development. Code modularization, using modules o...
详细信息
We propose a logic for partial reasoning over all general logic programs in a certain first-order language L. We need such a logic to express statements like it is impossible that a ground atom is both true and false ...
详细信息
Conflict learning plays a key role in modern Boolean constraint solving. Advanced in satisfiability testing, it has meanwhile become a base technology in many neighboring fields, among them answer set programming (ASP...
详细信息
暂无评论