Sciweavers

3047 search results - page 19 / 610
» On the Meaning of Logical Completeness
Sort
View
FOIKS
2008
Springer
13 years 10 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
CADE
2004
Springer
14 years 1 months ago
Modular Proof Systems for Partial Functions with Weak Equality
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
JSYML
2008
74views more  JSYML 2008»
13 years 8 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
FORMATS
2006
Springer
14 years 2 days ago
A Dose of Timed Logic, in Guarded Measure
We consider interval measurement logic IML, a sublogic of Zhou and Hansen's interval logic, with measurement functions which provide real-valued measurement of some aspect of ...
Kamal Lodaya, Paritosh K. Pandya
EUSFLAT
2009
100views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
Some Results on Lipschitz Quasi-Arithmetic Means
We present in this paper some properties of k-Lipschitz quasi-arithmetic means. The Lipschitz aggregation operations are stable with respect to input inaccuracies, what is a very i...
Gleb Beliakov, Tomasa Calvo, Simon James