Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
36
views
8
references
Top references
cited by
15
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,390
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
9th International Conference on Automated Deduction
SATCHMO: A theorem prover implemented in Prolog
other
Author(s):
Rainer Manthey
,
François Bry
Publication date
(Print):
1988
Publisher:
Springer-Verlag
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
8
Record
: found
Abstract
: not found
Article
: not found
Seventy-five problems for testing automatic theorem provers
Francis Pelletier
(1986)
0
comments
Cited
8
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Logic for improving integrity checking in relational data bases?
Jean-Marie Nicolas
(1982)
0
comments
Cited
6
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
A uniform approach to constraint satisfaction and constraint satisfiability in deductive databases
François Bry
,
Hendrik Decker
,
Rainer Manthey
(1988)
0
comments
Cited
5
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Pages
: 415-434
DOI:
10.1007/BFb0012847
SO-VID:
c5a96ccd-c88c-4069-a400-384e1f487422
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 61
Specifying theorem provers in a higher-order logic programming language
pp. 81
Query processing in quantitative logic programming
pp. 162
A mechanizable induction principle for equational specifications
pp. 278
Procedural interpretation of non-horn logic programs
pp. 538
Canonical conditional rewrite systems
pp. 752
A Prolog technology theorem prover
pp. 768
RRL: A rewrite rule laboratory
pp. 774
The CHIP system : Constraint handling in Prolog
pp. 111
The use of explicit plans to guide inductive proofs
pp. 415
SATCHMO: A theorem prover implemented in Prolog
pp. 500
A resolution calculus for modal logics
Similar content
1,390
Satchmo Blows Up the World
Authors:
Eschen Von
Satchmo meets amadeus
Authors:
K Luger
Problog: A probabilistic prolog and its application in link discovery
Authors:
L De Raedt
,
A Kimmig
,
H TOIVONEN
…
See all similar
Cited by
15
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
Authors:
Pasquale Rullo
,
Nicola Leone
,
Francesco Scarcello
An alternative approach to the semantics of disjunctive logic programs and deductive databases
Authors:
Chiaki Sakama
,
Katsumi Inoue
leanTAP: Lean tableau-based deduction
Authors:
Bernhard Beckert
,
Joachim Posegga
See all cited by