4573 search results - page 339 / 915 » Automated Reasoning |
153
click to vote
ICLP
1990
Springer
15 years 10 months ago
1990
Springer
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...
175
click to vote
LICS
1989
IEEE
15 years 10 months ago
1989
IEEE
We explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yiel...
137
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
168
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
Interactive Scores is a formalism for the design and performance of interactive scenarios that provides temporal relations (TRs) among the objects of the scenario. We can model TRs...
158
click to vote
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
We describe the combination of OWL and F-Logic for the architecture of Semantic Web application nodes. The approach has been implemented by combining an existing Jena-based archite...