Result 1 to 20 of 64 total
More SPASS with Isabelle. Superposition with hard sorts and configurable simplification. (English)
Beringer, Lennart (ed.) et al., Interactive theorem proving. Third international conference, ITP 2012, Princeton, NJ, USA, August 13‒15, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32346-1/pbk). Lecture Notes in Computer Science 7406, 345-360 (2012).
1
A PLTL-prover based on labelled superposition with partial model guidance. (English)
Gramlich, Bernhard (ed.) et al., Automated reasoning. 6th international joint conference, IJCAR 2012, Manchester, UK, June 26‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31364-6/pbk). Lecture Notes in Computer Science 7364. Lecture Notes in Artificial Intelligence, 537-543 (2012).
2
Combination of disjoint theories: Beyond decidability. (English)
Gramlich, Bernhard (ed.) et al., Automated reasoning. 6th international joint conference, IJCAR 2012, Manchester, UK, June 26‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31364-6/pbk). Lecture Notes in Computer Science 7364. Lecture Notes in Artificial Intelligence, 256-270 (2012).
3
Labelled superposition for PLTL. (English)
Bjørner, Nikolaj (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 18th international conference, LPAR-18, Mérida, Venezuela, March 11‒15, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28716-9/pbk). Lecture Notes in Computer Science 7180, 391-405 (2012).
4
Automatic generation of invariants for circular derivations in SUP(LA). (English)
Bjørner, Nikolaj (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 18th international conference, LPAR-18, Mérida, Venezuela, March 11‒15, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28716-9/pbk). Lecture Notes in Computer Science 7180, 197-211 (2012).
5
Superposition modulo non-linear arithmetic. (English)
Tinelli, Cesare (ed.) et al., Frontiers of combining systems. 8th international symposium, FroCoS 2011, Saarbrücken, Germany, October 5‒7, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-24363-9/pbk). Lecture Notes in Computer Science 6989. Lecture Notes in Artificial Intelligence, 119-134 (2011).
6
Towards verification of the pastry protocol using TLA$^{ + }$. (English)
Bruni, Roberto (ed.) et al., Formal techniques for distributed systems. Joint 13th IFIP WG 6.1 international conference, FMOODS 2011, and 31st IFIP WG 6.1 international conference, FORTE 2011, Reykjavik, Iceland, June 6‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21460-8/pbk). Lecture Notes in Computer Science 6722, 244-258 (2011).
7
Towards verification of the pastry protocol using $TLA^{+}$ (English)
FMOODS/FORTE, 244-258 (2011).
8
Superposition modulo non-linear arithmetic (English)
FroCos, 119-134 (2011).
9
Superposition-based analysis of first-order probabilistic timed automata. (English)
Fermüller, Christian G. (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 17th international conference, LPAR-17, Yogyakarta, Indonesia, October 10‒15, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-16241-1/pbk). Lecture Notes in Computer Science 6397, 302-316 (2010).
10
On the saturation of YAGO. (English)
Giesl, Jürgen (ed.) et al., Automated reasoning. 5th international joint conference, IJCAR 2010, Edinburgh, UK, July 16‒19, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14202-4/pbk). Lecture Notes in Computer Science 6173. Lecture Notes in Artificial Intelligence, 441-456 (2010).
11
Subterm contextual rewriting. (English)
AI Commun. 23, No. 2-3, 97-109 (2010).
12
Superposition for fixed domains (English)
ACM Trans. Comput. Log. 11, No. 4 (2010).
13
On the saturation of YAGO (English)
IJCAR, 441-456 (2010).
14
Superposition-based analysis of first-order probabilistic timed automata (English)
LPAR (Yogyakarta), 302-316 (2010).
15
Superposition modulo linear arithmetic SUP(LA). (English)
Ghilardi, Silvio (ed.) et al., Frontiers of combining systems. 7th international symposium, FroCoS 2009, Trento, Italy, September 16‒18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04221-8/pbk). Lecture Notes in Computer Science 5749. Lecture Notes in Artificial Intelligence, 84-99 (2009).
16
Labelled splitting. (English)
Ann. Math. Artif. Intell. 55, No. 1-2, 3-34 (2009).
17
Deciding the inductive validity of $\forall \exists ^{*}$ queries. (English)
Grädel, Erich (ed.) et al., Computer science logic. 23rd international workshop, CSL 2009, 18th annual conference of the EACSL, Coimbra, Portugal, September 7‒11, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04026-9/pbk). Lecture Notes in Computer Science 5771, 332-347 (2009).
18
Decidability results for saturation-based model building. (English)
Schmidt, Renate A. (ed.), Automated deduction ‒ CADE-22. 22nd international conference on automated deduction, Montreal, Canada, August 2‒7, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02958-5/pbk). Lecture Notes in Computer Science 5663. Lecture Notes in Artificial Intelligence, 404-420 (2009).
19
SPASS version 3.5. (English)
Schmidt, Renate A. (ed.), Automated deduction ‒ CADE-22. 22nd international conference on automated deduction, Montreal, Canada, August 2‒7, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02958-5/pbk). Lecture Notes in Computer Science 5663. Lecture Notes in Artificial Intelligence, 140-145 (2009).
20
Result 1 to 20 of 64 total
Start
Contact
Print
General Help
