Sciweavers

292 search results - page 57 / 59
» First-order intensional logic
Sort
View
RML
2002
162views Business» more  RML 2002»
13 years 7 months ago
A Markup Language for ORM Business Rules
Conceptual modeling techniques such as EER, ORM and to some extent the UML have been developed in the past for building information systems. These techniques or suitable extensions...
Jan Demey, Mustafa Jarrar, Robert Meersman
ECAI
2004
Springer
14 years 1 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
PODS
1994
ACM
138views Database» more  PODS 1994»
13 years 11 months ago
Dyn-FO: A Parallel, Dynamic Complexity Class
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
Sushant Patnaik, Neil Immerman
AAAI
1990
13 years 8 months ago
The Representation of Defaults in Cyc
This paper provides an account of the representation of defaults in Cyc and their semantics in terms of first order logic with reification. Default reasoning is a complex thing, a...
Ramanathan V. Guha
LICS
2008
IEEE
14 years 2 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis