Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. Sometimes this information is not sufficient for ...
详细信息
Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. Sometimes this information is not sufficient for solving a certain problem. In this paper we define graphs which are suitable for computing answer sets of different classes of logic programs. Intuitively, a graph associated to a logic program is suitable for answer set semantics if its structure is sufficient to compute the answer sets of the corresponding program. That is, algorithms that use suitable graphs do not have to consider the original logic program any longer. We investigate different classes of graphs which are suitable for answer set computation of normal nested logic programs, normal logic programs and normal programs with at most on positive body atom.
By using intersection types and filter models we formulate a theory of types for a λ-calculus with record subtyping via a finitary programminglogic. Types are interpreted as spaces of filters over a subset of the la...
详细信息
In this paper, we study the reachability problem for conditional term rewriting systems. Given two ground terms s and t, our practical aim is to prove s &rarrR* t for some join conditional term rewriting system R ...
详细信息
Term rewriting systems (TRSs) extended by allowing to contain extra variables in their rewrite rules are called EV-TRSs. They are ill-natured since every one-step reduction by their rules with extra variables is infin...
详细信息
In this paper we present a new framework for runtime verification of properties of real time systems such as financial systems or backend databases. Such a systems has a semantics which resemples that of timed traces,...
详细信息
This paper defines PT-resolution which is the integration of PT-resolution and approximate reasoning. PT-resolution is a deduction method based on partial intersection and truncation. The integration enables the deduc...
详细信息
We present a progress report on ongoing work to investigate topologies on spaces of interpretations in which one obtains the continuity of the operators associated with the well-founded, and alternating fixed-point se...
详细信息
Our Faculty embarked a few years ago on an ambitious project to redesign itself around an integrated information system, aimed at supporting all information handling activities and deployed through dynamic Web interfa...
详细信息
ISBN:
(纸本)3540003894
Our Faculty embarked a few years ago on an ambitious project to redesign itself around an integrated information system, aimed at supporting all information handling activities and deployed through dynamic Web interfaces automatically customized for individual users. The project includes both the design of the services and the development of appropriate software technology to implement them. It led already to a running system, supporting many official academic procedures, which is under constant evolution. The system architecture is fully based on Prolog, connected to an external database engine. This paper summarizes and discusses the characteristics that make Prolog a vehicle of choice for the implementation, along with a sketch of main aspects of the system architecture and the specific declarative techniques that were developed for them. The recurring methodological gain is the ease of building abstraction layers supported by specific term sub-languages, due to the combination of flexible operator syntax with the power of the underlying machinery to define new constructs. The basic programming layer evolved from standard Prolog to a novel structured version of it, with compositional semantics (no cuts) and direct support for structural abstraction and application, combining in practice the logic programming style with the higher-order power and some of the programming flavour of functional languages. The system's main architectural glue is the conceptual scheme, for which a definition language was developed whose expressions are compiled (by Prolog) to induce the database tables and (the instantiation of) a query/update language with a syntax based on compositionality principles of natural language, whose expressions are both more natural and much more compact than the equivalent in SQL.
Language for Structured Design (LSD) is a high level, visual, logic programming language for design of structured objects. LSD combines the design and programming activities in a homogeneous programming/design environ...
详细信息
ISBN:
(纸本)1581137052
Language for Structured Design (LSD) is a high level, visual, logic programming language for design of structured objects. LSD combines the design and programming activities in a homogeneous programming/design environment by extending Lograph, a visual logic programming language, with the notion of solids and operations on them. At the back-end, however, a solid modeling kernel for maintaining low level description of solids and operations is required. In this paper, we report on our progress towards employing PLaSM, a functional programming language for solid modeling, as the solid modeling kernel of LSD. This is achieved through the use of a translator engine which transforms the high level object description produced by LSD programs to PLaSM programs.
We solve the problem of obtaining answers to queries posed to a mediated integration system under the local-as-view paradigm that are consistent wrt to certain global integrity constraints. For this, the query program...
详细信息
We solve the problem of obtaining answers to queries posed to a mediated integration system under the local-as-view paradigm that are consistent wrt to certain global integrity constraints. For this, the query program is combined with logic programming specifications under the stable model semantics of the class of minimal global instances, and of the class of their repairs.
暂无评论