The programming language Prolog allows succinct representation of a wide variety of scheduling problems. To speed up execution, a new version called CHIP (Constraint Handling In Prolog) was introduced that maintains t...
详细信息
The programming language Prolog allows succinct representation of a wide variety of scheduling problems. To speed up execution, a new version called CHIP (Constraint Handling In Prolog) was introduced that maintains the programming advantages of Prolog. CHIP achieves its speed by keeping track of the sets of possible values for each variable. In this way, a search can be abandoned as soon as any such set becomes empty. This mechanism is made part of the unification algorithm. CHIP maintains the conventional orientation of logic towards single values. Thus, an awkward theoretical structure results from interfacing with set orientation in unification. This problem is solved by using a set-orientation for the entire logic.< >
We study a variety of ways to specify a two sorted structure involving the Booleans B, with constants true and false and a finite set D with an equality function eq to the Booleans, under the assumption that there is ...
详细信息
We study a variety of ways to specify a two sorted structure involving the Booleans B, with constants true and false and a finite set D with an equality function eq to the Booleans, under the assumption that there is a constant (name) for each element of D. The specifications are evaluated with respect to several properties, like textual length, efficiency in execution and the use of special features.
This paper makes two contributions. First, we give a semantics for sets of clauses of the syntactic form L 0 ⇍ L 1 &⋯& L n where each L i is a literal. We call such clauses generally Horn clauses. Any such end...
详细信息
This paper makes two contributions. First, we give a semantics for sets of clauses of the syntactic form L 0 ⇍ L 1 &⋯& L n where each L i is a literal. We call such clauses generally Horn clauses. Any such endeavour has to give a coherent, formal treatment of inconsistency (in the sense of two-valued logic). Thus, as a second contribution, we give a robust semantics for generally Horn programs that allows us to “make sense” of sets of generally Horn clauses that are inconsistent (in the two-valued logic sense). This applies to the design of very large knowledge bases where inconsistent information is often present.
Our aim is to present here a proposal of counterfactual truth value evaluation, based on a notion of relevance, which we compare to classical counterfactual evaluation. Informally we demand that the truth value of the...
详细信息
This paper makes two contributions. Firstly, we give a semantics for sets of clauses of the form L0 ⇐ L1&.. &Ln where each Li is a literal. We call such clauses generally-Horn clauses. Any such endeavour has t...
详细信息
This paper describes an algorithm for the interpretation of temporal relations between events mentioned in narrative (such as which event occurs before another). These relations are decided through three different lev...
Prolog has established itself as a highly successful example of the logicprogramming paradigm. Today there are a number of vigorous research streams exploring methods of extending the capabilities and capacities achi...
详细信息
Serious Prolog implementations in recent years have been primarily compiler-based, nearly all of which are founded on the abstract instruction set of Warren [1983]. The performance achieved by such implementations gre...
详细信息
The design and implementation of a relatively portable Prolog compiler achieving 12K LIPS on the standard benchmark is described. The compiler is incremental and uses decompilation to implement retract, clause, and li...
详细信息
暂无评论