352 search results - page 40 / 71 » Paraconsistent Declarative Semantics for Extended Logic Prog... |
139
Voted
LICS
1994
IEEE
15 years 7 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
121
click to vote
TYPES
1993
Springer
15 years 7 months ago
1993
Springer
Abstract. We explore the expressive power of the formalism called Natural Operational Semantics, NOS, introduced by Burstall and Honsell for defining the operational semantics of ...
ENTCS
2008
15 years 2 months ago
2008
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
128
click to vote
RISE
2004
Springer
15 years 8 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
145
click to vote
RR
2010
Springer
15 years 22 days ago
2010
Springer
The Accountability In RDF (AIR) language is an N3-based, Semantic Web production rule language that supports nested activation of rules, negation, closed world reasoning, scoped co...