Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 60 matches
- 2001
- Christian Anger, Kathrin Konczak, Thomas Linke:
NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics. IJCAR 2001: 325-330 - Alessandro Armando, Luca Compagna, Silvio Ranise:
System Description: RDL : Rewrite and Decision Procedure Laboratory. IJCAR 2001: 663-669 - Pablo A. Armelín, David J. Pym:
Bunched Logic Programming. IJCAR 2001: 289-304 - Gilles Audemard, Laurent Henocque:
The eXtended Least Number Heuristic. IJCAR 2001: 427-442 - Jürgen Avenhaus, Bernd Löchner:
CCE: Testing Ground Joinability. IJCAR 2001: 658-662 - Arnon Avron, Iddo Lev:
Canonical Propositional Gentzen-Type Systems. IJCAR 2001: 529-544 - Franz Baader, Stephan Tobies:
The Inverse Method Implements the Automata Approach for Modal Satisfiability. IJCAR 2001: 92-106 - Bernhard Beckert, Steffen Schlager:
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities. IJCAR 2001: 626-641 - Michael Beeson:
A Second-Order Theorem Prover Applied to Circumscription. IJCAR 2001: 318-324 - Marco Benedetti:
Conditional Pure Literal Graphs. IJCAR 2001: 331-346 - Bernard Boigelot, Sébastien Jodogne, Pierre Wolper:
On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables. IJCAR 2001: 611-625 - Maria Paola Bonacina:
Combination of Distributed Search and Multi-search in Peers-mcd.d. IJCAR 2001: 448-452 - Serenella Cerrito, Marta Cialdea Mayer:
Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation. IJCAR 2001: 137-151 - Luis Fariñas del Cerro, David Fauthoux, Olivier Gasquet, Andreas Herzig, Dominique Longin, Fabio Massacci:
Lotrec : The Generic Tableau Prover for Modal and Description Logics. IJCAR 2001: 453-458 - Sylvie Doutre, Jérôme Mengin:
Preferred Extensions of Argumentation Frameworks: Query Answering and Computation. IJCAR 2001: 272-288 - Uwe Egly, Stephan Schmitt:
Deriving Modular Programs from Short Proofs. IJCAR 2001: 561-577 - Armin Fiedler:
P.rex: An Interactive Proof Explainer. IJCAR 2001: 416-420 - Andrea Formisano, Eugenio G. Omodeo, Marco Temperini:
Instructing Equational Set-Reasoning with Otter. IJCAR 2001: 152-167 - Harald Ganzinger, David A. McAllester:
A New Meta-complexity Theorem for Bottom-Up Logic Programs. IJCAR 2001: 514-528 - Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela:
Context Trees. IJCAR 2001: 242-256 - Martin Giese:
Incremental Closure of Free Variable Tableaux. IJCAR 2001: 545-560 - Jürgen Giesl, Deepak Kapur:
Decidable Classes of Inductive Theorems. IJCAR 2001: 469-484 - Enrico Giunchiglia, Marco Maratea, Armando Tacchella, Davide Zambonin:
Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability. IJCAR 2001: 347-363 - Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella:
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability. IJCAR 2001: 364-369 - Volker Haarslev, Ralf Möller:
RACER System Description. IJCAR 2001: 701-706 - Volker Haarslev, Ralf Möller, Anni-Yasmin Turhan:
Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics. IJCAR 2001: 61-75 - Volker Haarslev, Ralf Möller, Michael Wessel:
The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach. IJCAR 2001: 29-44 - Reiner Hähnle, Neil V. Murray, Erik Rosenthal:
Ordered Resolution vs. Connection Graph Resolution. IJCAR 2001: 182-194 - Jens Happe:
The MODPROF Theorem Prover. IJCAR 2001: 459-463 - Joshua S. Hodas, Naoyuki Tamura:
lolliCop - A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic. IJCAR 2001: 670-684
skipping 30 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-04-19 03:51 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint