We present a methodology for handling efficiently relations over small finite domains in the rule-based programming language ELAN. Usually, a relation is specified as a first-order formula (a constraint) interpreted i...
详细信息
This paper develops the formal framework of ant programming with the goal of gaining a deeper understanding on ant colony optimization and, more in general, on the principles underlying the use of an iterated Monte Ca...
详细信息
The representation of defeasible information in Description logics is a well-known issue and many formal approaches have been proposed. However, in these proposals, little attention has been devoted to studying their ...
详细信息
learning technique that learns first-order rules from relationalstructured data. However, to-date most ILP systems can only be applied to small datasets (tens of thousands of examples). A long-standing challenge in th...
详细信息
Distributed systems that dynamically adapt to changing environments should be developed based on incrementally defined, loosely coupled services. But current middleware platforms tend to encourage monolithic services ...
详细信息
ISBN:
(纸本)1581139497
Distributed systems that dynamically adapt to changing environments should be developed based on incrementally defined, loosely coupled services. But current middleware platforms tend to encourage monolithic services that are tightly coupled with their environments. We suggest that the non-incremental nature of middleware services is due in part to the lack of support for implementation inheritance, and that tight coupling is due to insufficient support for interface abstraction. Interface-oriented programming (IOP) is an extension of object-oriented programming in which all program inter-dependencies, including inheritance dependencies, are expressed using interface abstractions. This encourages development of partial classes, and requires a new program linking mechanism called representation inference to integrate them. We propose that a distributed implementation of IOP including partial services and distributed service inference could address some of the limitations of middleware systems, providing new opportunities for performance reflection and transparent adaptation. Copyright 2004 ACM.
The purpose of this work is to define a theorem prover that retains the procedural aspects of logic programing. The proof system we propose (SLWV-resolution, for Selected Linear Without contrapositive clause Variants)...
详细信息
These are the proceedings of the First international Conference on Compu- tional logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. The theme of the conference covered all aspec...
详细信息
ISBN:
(数字)9783540449577
ISBN:
(纸本)9783540677970
These are the proceedings of the First international Conference on Compu- tional logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. The theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. The conference was collocated with the following events: { 6th international Conference on Rules and Objects in Databases (DOOD 2000) { 10th internationalworkshop on logic-based Program Synthesis and Tra- formation (LOPSTR 2000) { 10th international Conference on Inductive logicprogramming (ILP 2000). CL 2000 consisted of seven streams: { Program Development (LOPSTR 2000) { logicprogramming: Theory and Extensions { Constraints { Automated Deduction: Putting Theory into Practice { knowledgerepresentation and Non-monotonic Reasoning { Database Systems (DOOD 2000) { logicprogramming: Implementations and Applications. The LOPSTR 2000 workshop constituted the program development stream and the DOOD 2000 conference constituted the database systems stream. Each stream had its own chair and program committee, which autonomously selected the papers in the area of the stream. Overall, 176 papers were submitted, of which 86 were selected to be presented at the conference and appear in these proceedings. The acceptance rate was uniform across the streams. In addition, LOPSTR 2000 accepted about 15 extended abstracts to be presented at the conference in the program development stream.
The language {log} is a Constraint logicprogramming language that natively supports finite sets and constraints such as (non) equality and (non) membership. The set constraints resolution process is mathematically fo...
详细信息
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hard-ware specification, and temporal predictability. The robustness and checkability of these...
详细信息
ISBN:
(纸本)1595935770
Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hard-ware specification, and temporal predictability. The robustness and checkability of these programs could be greatly improved if modern type systems and programming language ideas, such as polymorphism and type inference, could be applied to these programs. BitC is a higher-order programming language in the tradition of ML and Haskell, extended to incorporate both state and the expression of unboxed and low-level datatypes. State and unboxed value types interact in subtle ways with polymorphic type-inference. Unless handled with care in the language design, interactions of these features can lead to unsoundness or results that are counter-intuitive to the programmer. Because instances of value types may have mutable components, a decision must be made concerning their compatibility at copy boundaries: should structurally equivalent types that differ only in their mutability be considered compatible. The choice impacts both the amount of polymorphism that the language can preserve and the burden of type annotation imposed on the programmer. This paper presents some of these challenges and our design for how to address these issues. Copyright 2006 ACM.
In the last years, there has been an increasing interest in the performance of reasoning on the Semantic Web in presence of large ABoxes. Traditional reasoners make heavily use of in-memory structures and are therefor...
详细信息
ISBN:
(纸本)9783540768890
In the last years, there has been an increasing interest in the performance of reasoning on the Semantic Web in presence of large ABoxes. Traditional reasoners make heavily use of in-memory structures and are therefore not suitable to deal with large ABoxes directly. We propose an approach that, informally speaking, works on a composite representation of the role-part of a SHIQ knowledge base. With respect to conjunctive queries, this helps us to provide a kind of proxy that restricts the set of possible bindings for a variable in advance. Furthermore we can use this proxy to reject several queries with no answer substitution immediately. Most notably our approach is query independent.
暂无评论