Sciweavers

1321 search results - page 48 / 265
» Subtyping in Logical Form
Sort
View
KR
2004
Springer
15 years 5 months ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget
LICS
1990
IEEE
15 years 3 months ago
Normal Process Representatives
This paper discusses the relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net. We base our discussion on two ...
Vijay Gehlot, Carl A. Gunter
TPHOL
1992
IEEE
15 years 3 months ago
The HOL Logic Extended with Quantification over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
Thomas F. Melham
ISMVL
2000
IEEE
103views Hardware» more  ISMVL 2000»
15 years 3 months ago
Experiments on FPRM Expressions for Partially Symmetric Logic Functions
This paper focuses on the fixed polarity ReedMuller (FPRM) expression of multiple-valued logic (MVL) symmetric functions. In the FPRM expression, each variable occurs in exactly o...
Svetlana N. Yanushkevich, Jon T. Butler, Gerhard W...
CADE
2010
Springer
14 years 10 months ago
Terminating Tableaux for Hybrid Logic with Eventualities
x-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision pro...
Mark Kaminski, Gert Smolka