Sciweavers

1269 search results - page 110 / 254
» Pi-Calculus in Logical Form
Sort
View
JSC
2000
117views more  JSC 2000»
15 years 14 days ago
Goals and Benchmarks for Automated Map Reasoning
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...
Andrea Formisano, Eugenio G. Omodeo, Marco Temperi...
101
Voted
LPAR
2010
Springer
14 years 11 months ago
Clause Elimination Procedures for CNF Formulas
Abstract. We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedu...
Marijn Heule, Matti Järvisalo, Armin Biere
167
Voted
FLAIRS
2009
14 years 10 months ago
A Knowledge Compilation Technique for ALC Tboxes
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be answered ef...
Ulrich Furbach, Heiko Günther, Claudia Oberma...
SBBD
2004
166views Database» more  SBBD 2004»
15 years 2 months ago
An Apriori-based Approach for First-Order Temporal Pattern Mining
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting sequen...
Sandra de Amo, Daniel A. Furtado, Arnaud Giacomett...
132
Voted
ENTCS
2006
138views more  ENTCS 2006»
15 years 21 days ago
Propositional Games with Explicit Strategies
This paper presents a game semantics for LP, Artemov's Logic of Proofs. The language of LP extends that of propositional logic by adding formula-labeling terms, permitting us...
Bryan Renne