Sciweavers

1391 search results - page 57 / 279
» Completeness of Neighbourhood Logic
Sort
View
DLT
2010
13 years 10 months ago
Algorithmic Properties of Millstream Systems
Abstract. Millstream systems have recently been proposed as a formalization of the linguistic idea that natural language should be described as a combination of different modules r...
Suna Bensch, Henrik Björklund, Frank Drewes
AAAI
1990
13 years 10 months ago
Skolem Functions and Equality in Automated Deduction
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to ...
William McCune
CADE
2006
Springer
14 years 9 months ago
Geometric Resolution: A Proof Procedure Based on Finite Model Search
We present a proof procedure that is complete for first-order logic, but which can also be used when searching for finite models. The procedure uses a normal form which is based on...
Hans de Nivelle, Jia Meng
LOGCOM
2002
85views more  LOGCOM 2002»
13 years 8 months ago
Fibring Labelled Deduction Systems
We give a categorial characterization of how labelled deduction systems for logics with a propositional basis behave under unconstrained fibring and under fibring that is constrai...
João Rasga, Amílcar Sernadas, Cristi...
CADE
2008
Springer
14 years 9 months ago
Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse
Abstract. We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic m...
Mark Kaminski, Gert Smolka